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!)
A014811 a(n) = Sum_{k=1..n-1} ceiling(k^2/n). 2

%I #8 Dec 19 2016 01:58:04

%S 0,1,3,5,8,12,17,22,26,33,41,49,56,66,77,86,96,107,121,135,148,162,

%T 179,196,206,225,243,263,280,302,323,344,364,385,411,433,456,482,511,

%U 538,560,589,617,649,676,708,741,774,798,831,869,903,936,972,1013,1052

%N a(n) = Sum_{k=1..n-1} ceiling(k^2/n).

%D M. Eichler and D. Zagier, The Theory of Jacobi Forms, Birkhauser, 1985, p. 103.

%p f := n->sum( ceil(k^2/n), k=1..n-1);

%o (PARI) a(n)=sum(k=1,n-1,ceil(k^2/n))

%K nonn

%O 1,3

%A _N. J. A. Sloane_

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 July 31 10:28 EDT 2024. Contains 374779 sequences. (Running on oeis4.)