id:A086747 - OEIS Search Results

Search: id:A086747

Displaying 1-1 of 1 results found.

page 1

Baum-Sweet sequence: a(n) = 1 if binary representation of n contains no block of consecutive zeros of odd length; otherwise a(n) = 0.

+0
8

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

	OFFSET	`0,1`
	REFERENCES	`J.-P. Allouche and J. Shallit, Automatic Sequences, Cambridge Univ. Press, 2003, p. 157.`
	LINKS	`Eric Weisstein's World of Mathematics, Baum-Sweet Sequence`
	CROSSREFS	`Cf. A037011.` `Sequence in context: A041004 A141736 A134842 this_sequence A141727 A123594 A145006` `Adjacent sequences: A086744 A086745 A086746 this_sequence A086748 A086749 A086750`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, Sep 12 2003`
	EXTENSIONS	`More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 14 2003`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research