Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115789
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115789 (Floor((n+1)*pi)-Floor(n*pi)) mod 2. +0
4
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; listen)
OFFSET

0,1

COMMENT

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(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, A115787, A115788, A115790.

Sequence in context: A118172 A118111 A119981 this_sequence A053864 A129667 A071374

Adjacent sequences: A115786 A115787 A115788 this_sequence A115790 A115791 A115792

KEYWORD

nonn

AUTHOR

Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jan 31 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research