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!)
 A087823 a(1) = a(2) = 1; for n > 2, a(n) = a(a(a(n-2))) + a(n-a(n-2)). 1
 1, 1, 2, 3, 3, 3, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 19, 20, 20, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS A triply recursive version of A005229. LINKS MATHEMATICA a[1] = a[2] = 1; a[n_Integer?Positive] := a[n] =a[a[a[n-2]]] +a[n - a[n-2]]; Table[a[n], {n, 1, 200}] PROG (PARI) a=vector(100); a[1]=a[2]=1; for(n=3, #a, a[n] = a[a[a[n-2]]]+a[n-a[n-2]]); a \\ Altug Alkan, Oct 01 2017 CROSSREFS Cf. A005229, A005374. Sequence in context: A308950 A193832 A293137 * A230418 A037037 A156262 Adjacent sequences:  A087820 A087821 A087822 * A087824 A087825 A087826 KEYWORD nonn,easy AUTHOR Roger L. Bagula, Oct 06 2003 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 September 27 03:21 EDT 2020. Contains 337380 sequences. (Running on oeis4.)