Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107436
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A107436
%S A107436 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,
%T A107436 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,
%U A107436 11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13
%N A107436 a(n) =a^(5)(n-1)+a(n-a(n-1)).
%C A107436 Multi-recursive sequence suggested by A004000 : 5th level.
%C A107436 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}]
%t A107436 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}]
%Y A107436 Cf. A028310, A004000, A087817, A087836, A087845, A087847.
%Y A107436 Sequence in context: A033810 A023965 A087847 this_sequence A002024 A123578 
               A087845
%Y A107436 Adjacent sequences: A107433 A107434 A107435 this_sequence A107437 A107438 
               A107439
%K A107436 nonn
%O A107436 1,3
%A A107436 Roger L, Bagula (tlbagulatftn(AT)yahoo.com), May 26 2005

    
page 1

Search completed in 0.001 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 December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research