|
Search: id:A107436
|
|
|
| A107436 |
|
a(n) =a^(5)(n-1)+a(n-a(n-1)). |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Multi-recursive sequence suggested by A004000 : 5th level.
If A004000 is a level 2 recursion and A087817 is 3rd and A087836 is 4th, this is sequence is the 5h level. Other multi-recursives approximate this sequence for intitial terms: A087845, A087847 Benoit Cloiture's sequence is: d = Table[Ceiling[n^.56], {n, 1, digits}]
|
|
MATHEMATICA
|
Conway[1] = Conway[2] = 1; Conway[n_Integer?Positive] := Conway[n] = Conway[Conway[Conway[Conway[Conway[n - 1]]]] ] + Conway[n - Conway[n - 1]] digits = 256; a = Table[Conway[n], {n, 1, digits}]
|
|
CROSSREFS
|
Cf. A028310, A004000, A087817, A087836, A087845, A087847.
Sequence in context: A033810 A023965 A087847 this_sequence A002024 A123578 A087845
Adjacent sequences: A107433 A107434 A107435 this_sequence A107437 A107438 A107439
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L, Bagula (tlbagulatftn(AT)yahoo.com), May 26 2005
|
|
|
Search completed in 0.002 seconds
|
