English

The Meta-C-finite Ansatz

Combinatorics 2022-07-01 v1

Abstract

The Fibonacci numbers satisfy the famous recurrence Fn=Fn1+Fn2F_n = F_{n - 1} + F_{n - 2}. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by mm, namely FmnF_{mn}, satisfy a similar recurrence for every positive integer mm, and these recurrences have an explicit, uniform representation. We will show that a(mn)a(mn) has a uniform recurrence over mm for any C-finite sequence a(n)a(n) and use this to automatically derive some famous summation identities.

Keywords

Cite

@article{arxiv.2206.14852,
  title  = {The Meta-C-finite Ansatz},
  author = {Robert Dougherty-Bliss},
  journal= {arXiv preprint arXiv:2206.14852},
  year   = {2022}
}
R2 v1 2026-06-24T12:08:48.429Z