English

Hyperfibonacci Sequences and Polytopic Numbers

Combinatorics 2016-06-21 v1 Number Theory

Abstract

We prove that the difference between the nn-th hyperfibonacci number of rr-th generation and its two consecutive predecessors is the nn-th regular (r1)(r-1)-topic number. Using this fact we provide an equivalent recursive definition of hyperfibonacci sequences and derive an extension of the Binet formula. We also prove further identities involving both hyperfibonacci and hyperlucas sequences, in full generality.

Keywords

Cite

@article{arxiv.1606.06228,
  title  = {Hyperfibonacci Sequences and Polytopic Numbers},
  author = {Ligia Loretta Cristea and Ivica Martinjak and Igor Urbiha},
  journal= {arXiv preprint arXiv:1606.06228},
  year   = {2016}
}

Comments

13 pages, 2 figures

R2 v1 2026-06-22T14:29:37.111Z