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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087834 a[n] =a[a[a[n-1]]] + a[n -1- a[n-2]] 0
1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 17 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Triple recursion version of A055748.

LINKS

Table of n, a(n) for n=1..82.

MATHEMATICA

hg[n_Integer?Positive] := hg[n] =hg[hg[hg[n-1]]] + hg[n -1- hg[n-2]] hg[1] = hg[2] = 1 digits=200 a=Table[hg[n], {n, 1, digits}]

CROSSREFS

Cf. A055748.

Sequence in context: A003056 A117707 A163352 * A172263 A337635 A140437

Adjacent sequences:  A087831 A087832 A087833 * A087835 A087836 A087837

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Oct 07 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 3 13:37 EST 2021. Contains 349463 sequences. (Running on oeis4.)