[go: up one dir, main page]

login
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
OFFSET
1,1
COMMENTS
Number of terms in s(n) is A112361(n).
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
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Nov 30 2005
EXTENSIONS
More terms from Joshua Zucker, Jul 27 2006
STATUS
approved