Closed form summation of 𝐶-finite sequences

DOI10.1090/S0002-9947-06-03994-8zbMath1119.05007arXivmath/0405574OpenAlexW1913494407MaRDI QIDQ3420266

Curtis Greene, Herbert S. Wilf

Publication date: 1 February 2007

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0405574

zbMATH Keywords

summationrecurrencesclosed formC-finite

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

AN EFFICIENT ALGORITHM FOR DERIVING SUMMATION IDENTITIES FROM MUTUAL RECURRENCES ⋮ The \(C\)-finite ansatz ⋮ Unnamed Item ⋮ Structure of Fibonacci cubes: a survey ⋮ SumCracker: A package for manipulating symbolic sums and related objects ⋮ Summation algorithms for Stirling number identities ⋮ On the Wiener index of generalized Fibonacci cubes and Lucas cubes

Uses Software

• Mathematica
• CFSum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating functions for powers of Fibonacci numbers
• A holonomic systems approach to special functions identities
• Sums of products of terms from linear recurrence sequences
• Advanced determinant calculus: a complement
• A Note on Generalized Vandermonde Determinants