login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,5
COMMENTS
Number of terms in s(n) is A114512(n).
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 this sequence.
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
Sequence in context: A351982 A029362 A216599 * A325466 A077029 A052553
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Dec 03 2005
EXTENSIONS
Extended by Ray Chandler, Dec 05 2005
STATUS
approved