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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108882 Period doubling sequence starting with '1 0 1'. 0
1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Start with S = 1,0,1; replace S by SS and complement the last bit; iterate.

Similar to A035263 but with a different start.

LINKS

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

MATHEMATICA

f[l_] := Block[{s = Flatten[{l, l}]}, s[[ -1]] = Mod[s[[ -1]] + 1, 2]; s]; Nest[f, {1, 0, 1}, 6] (* Robert G. Wilson v, Jul 16 2005 *)

PROG

s=[1 0 1]; loop s=concat(s, s); s(length(s))=(s(length(s))+1)modulo2 endloop

CROSSREFS

Cf. A035263.

Sequence in context: A132138 A141212 A137893 * A284656 A168002 A267050

Adjacent sequences:  A108879 A108880 A108881 * A108883 A108884 A108885

KEYWORD

easy,nonn

AUTHOR

Alexandre Losev, Jul 14 2005

EXTENSIONS

More terms from Robert G. Wilson v, Jul 16 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 12:37 EST 2019. Contains 329968 sequences. (Running on oeis4.)