Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115790
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115790 1 - (Floor((n+1)*pi)-Floor(n*pi)) mod 2. +0
4
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0 (list; graph; listen)
OFFSET

0,1

COMMENT

The arithmetic mean 1/(n+1)*sum(a(k)|k=0...n) converges to pi-3. What is effectively the same: the Cesaro limit (C1) of a(n) is pi-3.

FORMULA

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

EXAMPLE

a(6)=0 because 7*pi=21.99, 6*pi=18.85 and so a(6)=1-(21-18) mod 2 = 0;

a(7)=1 because 8*pi=25.13 and so a(7)=1-(25-21) mod 2 = 1;

CROSSREFS

Cf. A022844, A115787, A115788, A115789.

Sequence in context: A072401 A064873 A037823 this_sequence A025460 A101605 A135133

Adjacent sequences: A115787 A115788 A115789 this_sequence A115791 A115792 A115793

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research