OFFSET
0,4
COMMENTS
This sequence hits every positive integer.
LINKS
Muniru A Asiru, Table of n, a(n) for n = 0..10000
Abraham Isgur, Mustazee Rahman, On variants of Conway and Conolly's Meta-Fibonacci recursions, arXiv:1407.0425 [math.CO], 2014.
T. Kubo and R. Vakil, On Conway's recursive sequence, Discr. Math. 152 (1996), 225-252.
David Newman and Daniel J. Kleitman, Solution to Problem E3274, Amer. Math. Monthly, 98 (1991), 958-959.
FORMULA
a(n+1) - a(n) = 0 or 1 for all n >= 0.
MATHEMATICA
a[0] = 0; a[1] = 1; a[n_] := a[n] = +a[n - 1 - a[a[n - 1]]] + a[a[a[n - 1]]];
Table[a[i], {i, 1, 300}]
PROG
(GAP) a:=[1, 1];; for n in [3..80] do a[n]:=a[n-1-a[a[a[n-1]]]]+a[a[a[a[n-1]]]]; od; Concatenation([0], a); # Muniru A Asiru, Oct 28 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
David S. Newman, Oct 09 2018
STATUS
approved