Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087834
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087834 a[n] =a[a[a[n-1]]] + a[n -1- a[n-2]] +0
1
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; listen)
OFFSET

1,3

COMMENT

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 this_sequence A140437 A050500 A076885

Adjacent sequences: A087831 A087832 A087833 this_sequence A087835 A087836 A087837

KEYWORD

nonn

AUTHOR

Roger L Bagula (rlbagulatftn(AT)yahoo.com), Oct 07 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research