A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)

DOI10.1016/S0012-365X(98)80008-3zbMath0955.05003OpenAlexW2044758476MaRDI QIDQ1584390

Sara Brunetti, Elena Barcucci, Alberto del Lungo, Francesco Del Ristoro

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)80008-3

zbMATH Keywords

recurrence relationcombinatorial interpretationregular languageNSW numbersnumber of words

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10)

Related Items (6)

Some bijective results about the area of Schröder paths ⋮ ANISOTROPIC STEP, SURFACE CONTACT, AND AREA WEIGHTED DIRECTED WALKS ON THE TRIANGULAR LATTICE ⋮ A bijective approach to the area of generalized Motzkin paths ⋮ A technology for reverse-engineering a combinatorial problem from a rational generating function ⋮ Some linear recurrences and their combinatorial interpretation by means of regular languages ⋮ Arrays, numeration systems and Frankenstein games

Cites Work

• Some \(q\)-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths
• Simple groups of square order and interesting sequence of primes

This page was built for publication: A combinatorial interpretation of the recurrence \(f_{n+1}=6f_n-f_{n-1}\)