The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A087774 a[1] = 1, a[2] = a[3] = 2; a[n] = 3*a[a[n-1]] - 3*a[n-a[n-1]]+a[n-3]. 2
 11, 2, 2, 1, 2, 5, 1, 2, 8, 1, 2, 11, 1, 2, 14, 1, 2, 17, 1, 2, 20, 1, 2, 23, 1, 2, 26, 1, 2, 29, 1, 2, 32, 1, 2, 35, 1, 2, 38, 1, 2, 41, 1, 2, 44, 1, 2, 47, 1, 2, 50, 1, 2, 53, 1, 2, 56, 1, 2, 59, 1, 2, 62, 1, 2, 65, 1, 2, 68, 1, 2, 71, 1, 2, 74, 1, 2, 77, 1, 2, 80, 1, 2, 83, 1, 2, 86, 1, 2, 89, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS A recursive finite third derivative sequence. A tick-tock sequence of the form 1,2,a(n-3)+3 LINKS MATHEMATICA hg[n_Integer?Positive] := hg[n] =3*hg[hg[n-1]] -3*hg[n-hg[n-1]]+hg[n-3] hg[1]=1 hg[2]=2 hg[3]=2 digits=200 a=Table[hg[n], {n, 1, digits}] CROSSREFS Cf. A004001, A087775. Sequence in context: A010190 A323454 A261353 * A322562 A040118 A099268 Adjacent sequences:  A087771 A087772 A087773 * A087775 A087776 A087777 KEYWORD nonn AUTHOR Roger L. Bagula, Oct 04 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 6 15:30 EDT 2022. Contains 355110 sequences. (Running on oeis4.)