Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087836
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087836 a(n) =a(a(a(a(n-1)))) +a(n - a(n-1)) +0
5
1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 7, 8, 8, 8, 8, 8, 8, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 12, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 18, 18, 18, 19, 19, 19, 19, 19, 19 (list; graph; listen)
OFFSET

1,3

COMMENT

A fourth-order recursion based on A004001.

A phase break takes place at about n=500

MATHEMATICA

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

CROSSREFS

Cf. A004001. Different from A087817.

Sequence in context: A060802 A132073 A087817 this_sequence A091497 A005707 A087828

Adjacent sequences: A087833 A087834 A087835 this_sequence A087837 A087838 A087839

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research