Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114511
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
3
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; listen)
OFFSET

0,7

COMMENT

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

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: A079302 A138806 A104117 this_sequence A085199 A085200 A080024

Adjacent sequences: A114508 A114509 A114510 this_sequence A114512 A114513 A114514

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Dec 03 2005

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Dec 05 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research