|
|
A122046
|
|
Partial sums of floor(n^2/8).
|
|
8
|
|
|
0, 0, 0, 1, 3, 6, 10, 16, 24, 34, 46, 61, 79, 100, 124, 152, 184, 220, 260, 305, 355, 410, 470, 536, 608, 686, 770, 861, 959, 1064, 1176, 1296, 1424, 1560, 1704, 1857, 2019, 2190, 2370, 2560, 2760, 2970, 3190, 3421, 3663, 3916, 4180, 4456, 4744, 5044, 5356, 5681, 6019, 6370
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,5
|
|
COMMENTS
|
Degree of the polynomial P(n+1,x), defined by P(n,x) = [x^(n-1)*P(n-1,x)*P(n-4,x)+P(n-2,x)*P(n-3,x)]/P(n-5,x) with P(1,x)=P(0,x)=P(-1,x)=P(-2,x)=P(-3,x)=1.
Define the sequence b(n) = 1, 4, 10, 20, 36, 60,... for n>=0 with g.f. 1/((1+x)*(1+x^2)*(1-x)^5). Then a(n+3) = b(n)-b(n-1) and b(n)+b(n+1)+b(n+2)+b(n+3) = A052762(n+7)/24. - J. M. Bergot, Aug 21 2013
Maximum Wiener index of all maximal 4-degenerate graphs with n-1 vertices. (A maximal 4-degenerate graph can be constructed from a 4-clique by iteratively adding a new 4-leaf (vertex of degree 4) adjacent to four existing vertices.) The extremal graphs are 4th powers of paths, so the bound also applies to 4-trees. - Allan Bickle, Sep 15 2022
|
|
LINKS
|
|
|
FORMULA
|
a(n) = Sum_(k=0..n} floor(k^2/8).
a(n) = round((2*n^3 + 3*n^2 - 8*n)/48) = round((4*n^3 + 6*n^2 - 16*n - 9)/96) = floor((2*n^3 + 3*n^2 - 8*n + 3)/48) = ceiling((2*n^3 + 3*n^2 - 8*n - 12)/48). - Mircea Merca
a(n+1) = cos((2*n+1)*Pi/4)/(4*sqrt(2)) + (2*n+3)*(2*n^2 + 6*n - 5)/96 + (-1)^n/32.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) + a(n-4) - 3*a(n-5) + 3*a(n-6) - a(n-7). (End)
O.g.f.: x^3 / ( (1+x)*(x^2+1)*(x-1)^4 ). - R. J. Mathar, Jul 15 2008
a(n+3) = Sum_{k=0..6} min(6-k+1,k+1)* A190718(n+k-6). (End)
a(n) = (4*n^3 + 6*n^2 - 16*n - 9 - 3*(-1)^n + 12*(-1)^((2*n - 1 + (-1)^n)/4))/96. - Luce ETIENNE, Mar 21 2014
E.g.f.: ((2*x^3 + 9*x^2 - 3*x - 6)*cosh(x) + 6*(cos(x) + sin(x)) + (2*x^3 + 9*x^2 - 3*x - 3)*sinh(x))/48. - Stefano Spezia, Apr 05 2023
|
|
EXAMPLE
|
a(6) = 10 = 0 + 0 + 0 + 1 + 2 + 3 + 4.
|
|
MAPLE
|
|
|
MATHEMATICA
|
p[n_] := p[n] = Cancel[Simplify[ (x^(n - 1)p[n - 1]p[n - 4] + p[n - 2]*p[n - 3])/p[n - 5]]]; p[ -5] = 1; p[ -4] = 1; p[ -3] = 1; p[ -2] = 1; p[ -1] = 1; Table[Exponent[p[n], x], {n, 0, 20}]
Accumulate[Floor[Range[0, 60]^2/8]] (* or *) LinearRecurrence[{3, -3, 1, 1, -3, 3, -1}, {0, 0, 0, 1, 3, 6, 10}, 60] (* Harvey P. Dale, Dec 23 2019 *)
|
|
PROG
|
(Magma) [Round((2*n^3+3*n^2-8*n)/48): n in [0..60]]; // Vincenzo Librandi, Jun 25 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More formulas and better name from Mircea Merca, Nov 19 2010
|
|
STATUS
|
approved
|
|
|
|