id:A135022 - OEIS Search Results

Search: id:A135022

Displaying 1-1 of 1 results found.

page 1

Define a sequence of binary words by w(1)=10 and w(n+1)=w(n)w(n)Reverse[w(n)]. Sequence gives the limiting word w(infinity).

+0
1

1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Practically the same as A118006 but with different seed.`
	CROSSREFS	`Cf. A118006.` `Adjacent sequences: A135019 A135020 A135021 this_sequence A135023 A135024 A135025` `Sequence in context: A145273 A120522 A098033 this_sequence A071982 A129407 A014165`
	KEYWORD	`easy,nonn`
	AUTHOR	`Joel Reyes Noche (joel.noche(AT)up.edu.ph), Feb 10 2008`

page 1

Search completed in 0.002 seconds

Last modified January 8 02:43 EST 2009. Contains 152824 sequences.

AT&T Labs Research