On variants of Conway and Conolly's Meta-Fibonacci recursions

preprint2014arXivOpen access

Abstract

We study the recursions A(n)=A(n−a−Ak(n−b))+A(Ak(n−b))A(n) = A(n-a-A^k(n-b)) + A(A^k(n-b)) where a≥0a \geq 0, b≥1b \geq 1 are integers and the superscript kk denotes a kk-fold composition, and also the recursion C(n)=C(n−s−C(n−1))+C(n−s−2−C(n−3))C(n) = C(n-s-C(n-1)) + C(n-s-2-C(n-3)) where s≥0s \geq 0 is an integer. We prove that under suitable initial conditions the sequences A(n)A(n) and C(n)C(n) will be defined for all positive integers, and be monotonic with their forward difference sequences consisting only of 0 and 1. We also show that the sequence generated by the recursion for A(n)A(n) with parameters (k,a,b)=(k,0,1)(k,a,b) = (k,0,1), and initial conditions A(1)=A(2)=1A(1) = A(2) = 1, satisfies A(En)=En−1A(E_n) = E_{n-1} where EnE_n is defined by En=En−1+En−kE_n = E_{n-1} + E_{n-k} with En=1E_n = 1 for 1≤n≤k1 \leq n \leq k.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.