scientific article; zbMATH DE number 2145125
From MaRDI portal
Publication:4657453
Considering various tilings of \(1\)-by-\(n\) boards (e.g. in \(1\times 1\) squares and dominoes, in \(1\times 1\) squares and trinominoes, in coloured pieces of various lengths etc.) the authors obtain in a combinatorial way identities linking certain sums containing products of binomial coefficients to Fibonacci numbers (and various generalizations of Fibonacci numbers). In doing so as a bonus they find the answer to Problem A-6 from the 1990 Putnam exam. For the entire collection see [Zbl 1054.11005].
Recommendations
Cited in
(7)- Random Approaches to Fibonacci Identities
- Lucky 7-th exercises on inversion formulas and fibonomial coefficients
- A combinatorial proof of \(\sum^n_{k=0}kf_k\) or coins on a Fibonacci tiling
- Fibonacci identities from Jordan Identities
- On some fibinomial identities
- A weighted extension of Fibonacci numbers
- On product of companion matrices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4657453)