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

%I #13 Apr 13 2024 12:42:09

%S 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,

%T 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,

%U 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

%N a(n) = (floor((n+1)*Pi) - floor(n*Pi)) mod 2.

%C 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.

%F a(n) = (floor((n+1)*Pi) - floor(n*Pi)) mod 2.

%e a(6)=1 because 7*Pi=21.99..., 6*Pi=18.84... and so a(6) = (21 - 18) mod 2 = 1;

%e a(7)=0 because 8*Pi=25.13... and so a(7) = (25 - 21) mod 2 = 0.

%Y Cf. A000796, A022844, A063438, A115788, A115790.

%K nonn,changed

%O 0,1

%A _Hieronymus Fischer_, Jan 31 2006

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 April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)