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!)
A184969 a(n) = [Pi]+[2*Pi]+...+[n*Pi], where []=floor. 1
3, 9, 18, 30, 45, 63, 84, 109, 137, 168, 202, 239, 279, 322, 369, 419, 472, 528, 587, 649, 714, 783, 855, 930, 1008, 1089, 1173, 1260, 1351, 1445, 1542, 1642, 1745, 1851, 1960, 2073, 2189, 2308, 2430, 2555, 2683, 2814, 2949, 3087, 3228, 3372, 3519, 3669, 3822, 3979, 4139 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Michel Lagneau, Proof of convergence
FORMULA
Partial sums of A022844.
a(n)/n^2 ~ Pi/2.
a(n) = Pi/2 * n^2 + e(n) * n, where Pi/2-1 < e(n) < Pi/2. [Charles R Greathouse IV, May 27 2011]
MAPLE
with(numtheory):Digits:=100:s:=0:for n from 1 to 100 do: s:=s+floor(n*Pi):printf(`%d, `, s):od:
MATHEMATICA
Table[Sum[Floor[k*Pi], {k, 1, n}], {n, 1, 50}] (* G. C. Greubel, Sep 24 2017 *)
Accumulate[Floor[Pi Range[60]]] (* Much more efficient than the above program. *) (* Harvey P. Dale, Aug 27 2023 *)
PROG
(PARI) for(n=1, 50, print1(sum(k=1, n, floor(k*Pi)), ", ")) \\ G. C. Greubel, Sep 24 2017
CROSSREFS
Sequence in context: A193567 A045943 A134479 * A194113 A330010 A194114
KEYWORD
nonn
AUTHOR
Michel Lagneau, Mar 27 2011
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 3 08:32 EDT 2024. Contains 372207 sequences. (Running on oeis4.)