login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A114483 s(1)={1}. s(2)={1,0}. If a(n) = 0, s(n+2) = s(n+1) U s(n) U {1}. If a(n) = 1, s(n+2) = s(n+1) U s(n+1) U {1}. (U represents concatenation of finite sequences.) {a(n)} is the limit of {s(n)} as n -> infinity. 2
1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

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

LINKS

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

EXAMPLE

s(3) = {1,0,1,0,1}, s(4) = {1,0,1,0,1,1,0,1}, s(5) = {1,0,1,0,1,1,0,1,1,0,1,0,1,1,0,1,1}

CROSSREFS

Cf. A114482, A062318, A112361.

Sequence in context: A288932 A155482 A174205 * A127822 A111967 A177978

Adjacent sequences:  A114480 A114481 A114482 * A114484 A114485 A114486

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Nov 30 2005

EXTENSIONS

More terms from Joshua Zucker, Jul 27 2006

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 25 16:42 EST 2020. Contains 331245 sequences. (Running on oeis4.)