|
|
A114511
|
|
a(0) = 0. s(0) = {0}. s(n+1) = s(n) 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, 0, 0, 1, 0, 2, 0, 3, 0, 0, 0, 4, 0, 5, 0, 0, 0, 0, 1, 6, 0, 7, 0, 0, 0, 0, 1, 0, 2, 8, 0, 9, 0, 10, 0, 11, 0, 0, 0, 0, 1, 0, 2, 0, 3, 12, 0, 13, 0, 0, 0, 0, 1, 0, 2, 0, 3, 0, 0, 0, 4, 14, 0, 15, 0, 16, 0, 17, 0, 18, 0, 0, 0, 19, 0, 0, 0, 0, 1, 0, 2, 0, 3, 0, 0, 0, 4, 0, 5, 20, 0, 21, 0, 0, 0, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,7
|
|
COMMENTS
|
Number of terms in s(n) is A114513(n).
|
|
LINKS
|
|
|
EXAMPLE
|
s(1) = {0,0,0}, s(4) = {0,0,0,0,1,0,2,0,3}. s(5) = s(4) U s(a(4)) U {4} =
{0,0,0,0,1,0,2,0,3} U {0,0,0} U {4} = {0,0,0,0,1,0,2,0,3,0,0,0,4}, which are the first 13 terms of {a(n)}.
|
|
MATHEMATICA
|
s[0] = {0}; s[n_] := s[n] = Flatten[{s[n - 1], s[s[n - 1][[n]]], {n - 1}}]; s[23] (* Ray Chandler, Dec 05 2005 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|