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!)
A082644 a(n) = floor(n*(n-1/2)/2). 0

%I #10 Sep 08 2022 08:45:10

%S 0,0,1,3,7,11,16,22,30,38,47,57,69,81,94,108,124,140,157,175,195,215,

%T 236,258,282,306,331,357,385,413,442,472,504,536,569,603,639,675,712,

%U 750,790,830,871,913,957,1001,1046,1092,1140,1188,1237,1287,1339,1391,1444,1498

%N a(n) = floor(n*(n-1/2)/2).

%F a(n) = floor(n^3/(2n+1)). - _Gary Detlefs_, Feb 11 2010

%F a(n) = (4*n!/(n-2)!+2*n-3+(-1)^n+(-1)^(n/2)-(-1)^((n+1)/2)+(-1)^(-n/2)-(-1)^(-(n+1)/2))/8. - _Wesley Ivan Hurt_, May 19 2016

%p seq(floor(n^3/(2*n+1)), n=0..25); # _Gary Detlefs_, Feb 11 2010

%t Table[Floor[n^3/(2 n + 1)], {n, 0, 60}] (* _Wesley Ivan Hurt_, May 19 2016 *)

%o (Magma) [Floor(n^3/(2*n+1)) : n in [0..60]]; // _Wesley Ivan Hurt_, May 19 2016

%K nonn,easy

%O 0,4

%A _N. J. A. Sloane_, May 16 2003

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 April 16 04:38 EDT 2024. Contains 371696 sequences. (Running on oeis4.)