login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115789 a(n) = (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_{k=0..n} a(k) 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.84... 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
Sequence in context: A118111 A305940 A119981 * A359471 A363551 A053864
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 9 19:33 EDT 2024. Contains 372354 sequences. (Running on oeis4.)