id:A115971 - OEIS Search Results

Search: id:A115971

Displaying 1-1 of 1 results found.

page 1

a(0) = 0. If a(n) = 0, then a(2^n) through a(2^(n+1)-1) are each equal to 1. If a(n) = 1, then a(m + 2^n) = a(m) for each m, 0 <= m <= 2^n -1.

+0
1

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

	OFFSET	`0,1`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`a(2) = 0. So terms a(4) through a(7) are each equal to 1.` `a(3) = 1, so terms a(8) through a(15) are the same as terms a(0) through a(7).`
	CROSSREFS	`Sequence in context: A157412 A023532 A112690 this_sequence A072165 A072608 A125720` `Adjacent sequences: A115968 A115969 A115970 this_sequence A115972 A115973 A115974`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet, Mar 14 2006`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.

AT&T Labs Research