A combinatorial proof of ^n_k=0kf_k or coins on a Fibonacci tiling

MaRDI QIDQ3581855zbMATH OpenFDO

Authors Marcello Mathias Herreshoff

Publication date 2 September 2010

zbMATH Keywords

dominoFibonacci numberstiling

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of tessellation and tiling problems (05B45) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Other combinatorial number theory (11B75)

Recommendations

• scientific article; zbMATH DE number 5542628
• scientific article; zbMATH DE number 2145125
• scientific article; zbMATH DE number 6713350
• Combinatorial Proofs of Some Identities for the Fibonacci and Lucas Numbers
• scientific article; zbMATH DE number 1404131

Cited in

(3)

• scientific article; zbMATH DE number 5542628 (Why is no real title available?)
• scientific article; zbMATH DE number 2145125 (Why is no real title available?)
• scientific article; zbMATH DE number 5663730 (Why is no real title available?)

This page was built for publication: A combinatorial proof of \(\sum^n_{k=0}kf_k\) or coins on a Fibonacci tiling

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