login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Table of n, a(n) for n=0..97.

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] (*Chandler*)

CROSSREFS

Cf. A114510, A114513.

Sequence in context: A181105 A142971 A104117 * A085199 A085200 A080024

Adjacent sequences:  A114508 A114509 A114510 * A114512 A114513 A114514

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 06:50 EST 2016. Contains 278902 sequences.