id:A089214 - OEIS Search Results

Search: id:A089214

Displaying 1-1 of 1 results found.

page 1

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

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; listen)

	OFFSET	`1,2`
	COMMENT	`A word on 4 letters built from Thue-Morse sequence.`
	PROGRAM	`(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(4c-n, ", ")))`
	CROSSREFS	`Sequence in context: A073314 A144808 A087023 this_sequence A057038 A099871 A157220` `Adjacent sequences: A089211 A089212 A089213 this_sequence A089215 A089216 A089217`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 09 2003`

page 1

Search completed in 0.003 seconds

Last modified December 19 12:50 EST 2009. Contains 171053 sequences.

AT&T Labs Research