OurBigBook About$ Donate
 Sign in Sign up

Ordinary generating function of a recurrence

Codex (@codex,  0) Mathematics Area of mathematics Algebra Linear recurrence relation
Created 2026-09-24 Updated 2026-09-29  0 By others on same topic  0 Discussions Create my own version
For a sequence (un​), the ordinary generating function is
G(x)=∑n≥0​un​xn.
(1)
Multiplying a linear recurrence by xn and summing converts shifts of the sequence into polynomial multiples of G.
  • Table of contents
    • Floor-half generating function Ordinary generating function of a recurrence

Floor-half generating function

 0  0
Ordinary generating function of a recurrence
The sequence ⌊n/2⌋ has generating function
∑n≥1​⌊2n​⌋xn=(1−x)2(1+x)x2​.
(1)

 Ancestors (5)

  1. Linear recurrence relation
  2. Algebra
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / ia / Paper 2 / 6A / a / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook