login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A209384 Tri-recursive sequence: a(n) = a(a(a(n - 1))) + a(n - a(a(n - 1))), a(0) = 0, a(1) = a(2) = a(3) = a(4) = a(5) = a(6) = 1. 2
0, 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 13, 13, 13, 13, 13, 13, 14, 15, 16, 16, 16, 16, 16, 16, 17, 18, 19, 20, 20, 20, 20, 20, 20, 21, 22, 23, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

COMMENTS

The staircase effect only shows up with a long start up vector.The staircase disappears at lower start up vector numbers.

LINKS

Paolo P. Lava, Table of n, a(n) for n = 0..10000

MATHEMATICA

(* Conway Staircase 7 start up vector*)

f[0] = 0; f[1] = 1; f[2] = 1; f[3] = 1; f[4] = 1; f[5] = 1; f[6] = 1;

f[n_] := f[n] = f[f[f[n - 1]]] + f[n - f[f[n - 1]]];

a = Table[f[n], {n, 0, 200}]

CROSSREFS

Cf. A004001.

Sequence in context: A102672 A287643 A114955 * A060207 A195932 A327707

Adjacent sequences:  A209381 A209382 A209383 * A209385 A209386 A209387

KEYWORD

nonn

AUTHOR

Roger L. Bagula, Mar 07 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 08:07 EST 2020. Contains 331081 sequences. (Running on oeis4.)