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!)
A089214 Let u(1)=0, u(2)=1; for k>2, u(k)= A010060(k)*u(k-1) + u(k-2) (mod 2); then a(n)=4n-b(n) where sequence (b(k)) gives values such that u(b(k))=0. 0
1, 3, 2, 4, 2, 4, 1, 3, 2, 4, 1, 3, 1, 3, 2, 4, 2, 4, 1, 3, 1, 3, 2, 4, 1, 3, 2, 4, 2, 4, 1, 3, 2, 4, 1, 3, 1, 3, 2, 4, 1, 3, 2, 4, 2, 4, 1, 3, 1, 3, 2, 4, 2, 4, 1, 3, 2, 4, 1, 3, 1, 3, 2, 4, 2, 4, 1, 3, 1, 3, 2, 4, 1, 3, 2, 4, 2, 4, 1, 3, 1, 3, 2, 4, 2, 4, 1, 3, 2, 4, 1, 3, 1, 3, 2, 4, 1, 3, 2, 4, 2, 4, 1, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A word on 4 letters built from Thue-Morse sequence.

LINKS

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

PROG

(PARI) u=0; v=1; c=0; for(n=3, 550, w=u%2+(subst(Pol(binary(n)), x, 1)%2)*v; u=v; v=w; if(w==0, c++; print1(4*c-n, ", ")))

CROSSREFS

Sequence in context: A144808 A087023 A328052 * A057038 A175798 A294111

Adjacent sequences:  A089211 A089212 A089213 * A089215 A089216 A089217

KEYWORD

nonn

AUTHOR

Benoit Cloitre, Dec 09 2003

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 July 12 21:31 EDT 2020. Contains 335669 sequences. (Running on oeis4.)