This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A115789 (Floor((n+1)*pi)-Floor(n*pi)) mod 2. 3
 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; text; 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. LINKS FORMULA a(n) = (Floor((n+1)*pi)-Floor(n*pi)) mod 2. EXAMPLE a(6)=1 because 7*pi=21.99, 6*pi=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, A063438, A115788, A115790. Sequence in context: A118111 A305940 A119981 * A212793 A053864 A189021 Adjacent sequences:  A115786 A115787 A115788 * A115790 A115791 A115792 KEYWORD nonn AUTHOR Hieronymus Fischer, Jan 31 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 12:22 EST 2019. Contains 329895 sequences. (Running on oeis4.)