The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A095769 a(1)=a(2)=1; a(n)=a(a(a(a(n-1))))+a(n-a(a(a(n-1)))). 2
 1, 1, 2, 3, 4, 4, 5, 6, 6, 7, 8, 9, 9, 10, 11, 11, 12, 13, 13, 14, 15, 16, 17, 17, 17, 18, 19, 19, 20, 21, 22, 23, 24, 25, 26, 26, 26, 26, 27, 28, 28, 29, 30, 31, 31, 32, 33, 34, 35, 36, 37, 38, 39, 39, 39, 39, 39, 40, 41, 41, 42, 43, 44, 45, 46, 47, 47, 48, 48, 48, 49, 50, 51, 52 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A generalization of A004001. LINKS J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161. FORMULA For n>1, a(A000930(n)) = A000930(n-1); conjecture : limit n ->infty a(n)/n = 0.682327803828... the real positive root of x^3+x=1. PROG (PARI) v=vector(150, j, 1); for(n=3, 150, g=v[v[v[v[n-1]]]]+v[n-v[v[v[n-1]]]]; v[n]=g); a(n)=v[n] CROSSREFS Cf. A004001, A093878, A095770, A095771. Sequence in context: A094500 A049473 A154951 * A080820 A274687 A234604 Adjacent sequences:  A095766 A095767 A095768 * A095770 A095771 A095772 KEYWORD nonn AUTHOR Benoit Cloitre, Jun 05 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 03:03 EDT 2021. Contains 343994 sequences. (Running on oeis4.)