|
|
|
|
0, 1, 8, 9, 32, 25, 72, 49, 128, 81, 200, 121, 288, 169, 392, 225, 512, 289, 648, 361, 800, 441, 968, 529, 1152, 625, 1352, 729, 1568, 841, 1800, 961, 2048, 1089, 2312, 1225, 2592, 1369, 2888, 1521, 3200, 1681, 3528, 1849, 3872, 2025, 4232, 2209, 4608, 2401
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(2*n+1) = 1 + 4*n + 4*n^2 = A016754(n).
a(n) = 3*a(n-2) - 3*a(n-4) + a(n-6).
G.f.: x*(1+8*x+6*x^2+8*x^3+x^4)/((1-x)^3*(1+x)^3). (End)
Sum_{n>=1} 1/a(n) = 7*Pi^2/48.
Sum_{n>=1} (-1)^(n+1)/a(n) = 5*Pi^2/48. (End)
a(n) = n^2*(3 + (-1)^n)/2.
E.g.f.: (1/2)*x*(-1 + x + 3*(1 + x)*exp(2*x)). (End)
|
|
MATHEMATICA
|
LinearRecurrence[{0, 3, 0, -3, 0, 1}, {0, 1, 8, 9, 32, 25}, 50] (* Harvey P. Dale, Dec 01 2018 *)
|
|
PROG
|
(Haskell)
a181900 n = a022998 n * n
(SageMath) [n^2*(1 + ((n+1)%2)) for n in (0..60)] # G. C. Greubel, Aug 01 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,mult
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|