Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117882
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117882 Partial sums of floor(pi^n). +0
1
1, 4, 13, 44, 141, 447, 1408, 4428, 13916, 43725, 137373, 431577, 1355846, 4259523, 13381694, 42039839, 132072059, 414916622, 1303499025, 4095062974, 12865019770, 40416651612, 126972655803, 398896362696, 1253169882609 (list; graph; listen)
OFFSET

0,2

COMMENT

The only prime in the sequence through a(50) is a(2) = 13.

FORMULA

a(n) = SUM[i=0..n] A001672(i). a(n) = SUM[i=0..n] floor(pi^i).

CROSSREFS

Cf. A001672.

Sequence in context: A113986 A042767 A045652 this_sequence A027123 A027125 A027127

Adjacent sequences: A117879 A117880 A117881 this_sequence A117883 A117884 A117885

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), May 02 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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research