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!)
A114510 a(1) = 0. s(0) = {0}. s(n) = s(n-1) U s(a(n)) U {n}, where U represents a concatenation of finite sequences. The sequence {a(n)} is the limit of s(m) as m -> infinity. 2
0, 0, 1, 0, 2, 0, 0, 1, 3, 0, 4, 0, 0, 1, 0, 2, 5, 0, 6, 0, 7, 0, 0, 1, 8, 0, 0, 1, 0, 2, 0, 0, 1, 3, 9, 0, 10, 0, 0, 1, 0, 2, 0, 0, 1, 3, 0, 4, 11, 0, 12, 0, 13, 0, 0, 1, 14, 0, 15, 0, 0, 1, 0, 2, 16, 0, 0, 1, 0, 2, 0, 0, 1, 3, 0, 4, 0, 0, 1, 0, 2, 5, 17, 0, 18, 0, 0, 1, 0, 2, 0, 0, 1, 3, 0, 4, 0, 0, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Number of terms in s(n) is A114512(n).

LINKS

Table of n, a(n) for n=1..100.

EXAMPLE

s(1) = {0,0,1}, s(2) = {0,0,1,0,2}. s(3) = s(2) U s(a(3)) U {3} =

{0,0,1,0,2} U {0,0,1} U {3} = {0,0,1,0,2,0,0,1,3}, which are the first 9 terms of {a(n)}.

MATHEMATICA

s[0] = {0}; s[n_] := s[n] = Flatten[{s[n - 1], s[s[n - 1][[n]]], {n}}]; s[19] (* Ray Chandler, Dec 05 2005 *)

CROSSREFS

Cf. A114511, A114512.

Sequence in context: A297617 A029362 A216599 * A325466 A077029 A052553

Adjacent sequences:  A114507 A114508 A114509 * A114511 A114512 A114513

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Dec 03 2005

EXTENSIONS

Extended by Ray Chandler, Dec 05 2005

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 19 04:09 EST 2020. Contains 331031 sequences. (Running on oeis4.)