A115971 - OEIS

This site is supported by donations to The OEIS Foundation.

A115971

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, 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; refs; listen; history; internal format)

	OFFSET	`0,1`
	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: A023532 A030308 A112690 * A072165 A072608 A171386` `Adjacent sequences: A115968 A115969 A115970 * A115972 A115973 A115974`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet, Mar 14 2006`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 08:47 EST 2012. Contains 205739 sequences.