A combinatorial interpretation of the generalized Fibonacci numbers

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Review text

The author considers the Fibonacci numbers of order \(k\), i.e., the numbers \(F^{(k)}_n\) defined by the recurrence relation \(F^{(k)}_{n+ k}= F_{n+k-1}^{(k)}+ F_{n+ k-2}^{(k)}+\cdots+ F_{n+1}^{(k)}+ F^{(k)}_n\) and, as in \textit{D. E. Knuth} [The art of computer programming, Vol. 3, Addison-Wesley (1974; Zbl 0302.68010)], by the initial conditions \(F^{(k)}_0=\cdots= F_{k-2}^{(k)}= 0\), \(F_{k-1}^{(k)}= 1\). He derives a combinatorial interpretation of them in the context of the linear species of \textit{A. Joyal} [Adv. Math. 42, 1-82 (1981; Zbl 0491.05007)] as the linear species of \(k\)-filtering partitions. He also proves a number of interesting identities.

Recommendations

Cites work

Cited in

(16)

This page was built for publication: A combinatorial interpretation of the generalized Fibonacci numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373439)