OFFSET
1,3
COMMENTS
For n>1: a(n)<n*(phi-1) iff n is in A001519 where phi is the golden ratio = (1+sqrt(5))/2 - Benoit Cloitre, May 27 2004
LINKS
J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.
Abraham Isgur, Mustazee Rahman, On variants of Conway and Conolly's Meta-Fibonacci recursions, arXiv:1407.0425 [math.CO], 2014.
FORMULA
a(A001519(n)) = floor((phi-1)*A001519(n)); a(A000045(n)) = A000045(n-1); liminf a(n)/n = phi-1; limsup a(n)/n = ? - Benoit Cloitre, May 27 2004
MATHEMATICA
a[1] = a[2] = 1; a[n_] := a[n] = a[a[a[n - 1]]] + a[n - a[a[n - 1]]]; Table[ a[n], {n, 75}] (* Robert G. Wilson v, May 27 2004 *)
PROG
(PARI) {m=75; v=vector(m, j, 1); for(n=3, m, a=v[v[v[n-1]]]+v[n-v[v[n-1]]]; v[n]=a); for(j=1, m, print1(v[j], ", "))} \\ Klaus Brockhaus, May 27 2004
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 27 2004
EXTENSIONS
STATUS
approved