A combinatorial proof for the generating function of powers of a second-order recurrence sequence

zbMATH Open1384.05033MaRDI QIDQ4637136FDOQ4637136

Yifan Zhang, George Grossman

Publication date: 18 April 2018

Full work available at URL: https://cs.uwaterloo.ca/journals/JIS/VOL21/Zhang/zhang44.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• scientific article; zbMATH DE number 2077509
• A combinatorial proof for the generating function of powers of the Fibonacci sequence
• Several generating functions for second-order recurrence sequences
• scientific article; zbMATH DE number 24558
• scientific article; zbMATH DE number 2145259

zbMATH Keywords

generating functionmatrixPascal triangleEulerian polynomialsecond-order recurrence sequence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Bernoulli and Euler numbers and polynomials (11B68)

Cites Work

• The On-Line Encyclopedia of Integer Sequences
• Title not available (Why is that?)
• Generating functions for powers of Fibonacci numbers
• Title not available (Why is that?)
• A bijective proof of Riordan's theorem on powers of Fibonacci numbers
• Title not available (Why is that?)
• Tiling a \((2 \times n)\)-board with squares and dominoes
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Several generating functions for second-order recurrence sequences
• Title not available (Why is that?)

Uses Software

• OEIS

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)