A combinatorial proof for the generating function of powers of a second-order recurrence sequence
From MaRDI portal
Publication:4637136
Recommendations
Cites work
- A bijective proof of Riordan's theorem on powers of Fibonacci numbers
- A combinatorial proof for the generating function of powers of the Fibonacci sequence
- Generating functions for powers of Fibonacci numbers
- scientific article; zbMATH DE number 2077509 (Why is no real title available?)
- scientific article; zbMATH DE number 1919515 (Why is no real title available?)
- scientific article; zbMATH DE number 2108148 (Why is no real title available?)
- The On-Line Encyclopedia of Integer Sequences
- Tiling a (2 n)-board with squares and dominoes
Cited in
(7)- Several generating functions for second-order recurrence sequences
- scientific article; zbMATH DE number 24558 (Why is no real title available?)
- scientific article; zbMATH DE number 2077509 (Why is no real title available?)
- A combinatorial proof for the generating function of powers of the Fibonacci sequence
- Generating functions for sequences of disordered covers numbers
- On linear recurrence equations arising from compositions of positive integers
- Products of multiple-index Fibonacci numbers
This page was built for publication: A combinatorial proof for the generating function of powers of a second-order recurrence sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637136)