A115789 - OEIS

This site is supported by donations to The OEIS Foundation.

A115789

(Floor((n+1)*pi)-Floor(n*pi)) mod 2.

1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,1`
	COMMENTS	`The arithmetic mean 1/(n+1)*sum(a(k)\|k=0...n) converges to 4-pi. What is effectively the same: the Cesaro limit (C1) of a(n) is 4-pi.`
	FORMULA	`a(n) = (Floor((n+1)pi)-Floor(npi)) mod 2.`
	EXAMPLE	`a(6)=1 because 7pi=21.99, 6pi=18.85 and so a(6)=(21-18) mod 2 = 1;` `a(7)=0 because 8*pi=25.13 and so a(7)=(25-21) mod 2 = 0;`
	CROSSREFS	`Cf. A022844, A115787, A115788, A115790.` `Sequence in context: A071039 A118111 A119981 * A053864 A129667 A071374` `Adjacent sequences: A115786 A115787 A115788 * A115790 A115791 A115792`
	KEYWORD	`nonn`
	AUTHOR	`Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jan 31 2006`

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

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.