login
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
OFFSET
1,3
COMMENTS
Triple recursion version of A055748.
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
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Oct 07 2003
STATUS
approved