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

Yifan Zhang, George Grossman

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we derive a formula for the generating function of powers of a second-order linear recurrence sequence, with initial conditions 0 and 1. As an example, we find the generating function of the powers of the nonnegative integers. We also find new formulas for computing Eulerian polynomials.

Original languageEnglish
Article number18.3.3
JournalJournal of Integer Sequences
Volume21
Issue number3
StatePublished - Jan 1 2018

Keywords

  • Eulerian polynomial
  • Generating function
  • Matrix
  • Pascal triangle
  • Second-order recurrence sequence

Fingerprint

Dive into the research topics of 'A combinatorial proof for the generating function of powers of a second-order recurrence sequence'. Together they form a unique fingerprint.

Cite this