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!)
A166870 a(n) = n*(n-1)*A056219(n+1). 3
4, 24, 60, 120, 270, 546, 840, 1368, 2250, 3740, 5544, 7956, 11102, 16380, 23520, 33184, 44676, 59850, 79420, 106260, 141834, 189244, 245088, 314400, 401050, 511758, 648648, 824992, 1044000, 1315020, 1635808, 2023296, 2494206, 3077340 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
LINKS
MAPLE
N:= 100; b:= seq(coeff(series(add(x^((1/2)*n*(n+1))*mul(x +1/(1-x^k), k=1..n), n = 1..floor((1/2)*sqrt(9+8*N))), x, N+2), x, j), j = 1..N+1); seq(n*(n-1)*b[n+1], n=2..N); # G. C. Greubel, Nov 29 2019
MATHEMATICA
max:= 100; b:= CoefficientList[Series[Sum[x^(n*(n+1)/2)*Product[(x +1/(1-x^k)), {k, n}], {n, Floor[Sqrt[9 +8*(max+5)]/2]}], {x, 0, max+5}], x]; Table[n*b[[n + 2]], {n, 2, max}] (* G. C. Greubel, Nov 29 2019 *)
PROG
(Magma)
max:=50;
R<x>:=PowerSeriesRing(Integers(), max); b:= Coefficients(R!( (&+[x^Binomial(n+1, 2)*(&*[x + 1/(1-x^j): j in [1..n]]): n in [1..Floor(Sqrt(9+8*max)/2)]]) ));
[(n-1)*(n-2)*b[n]: n in [3..max-1]]; // G. C. Greubel, Nov 29 2019
(Sage)
max=50;
def A056219_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P( sum(x^binomial(n+1, 2)*product((x + 1/(1-x^j)) for j in (1..n)) for n in (1..floor(sqrt(9+8*max)/2))) ).list()
b=A056219_list(max);
[(n-1)*(n-2)*b[n] for n in (3..max)] # G. C. Greubel, Nov 29 2019
CROSSREFS
Sequence in context: A157625 A128205 A085250 * A124350 A112611 A363092
KEYWORD
nonn,less
AUTHOR
Roger L. Bagula, Oct 22 2009
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 April 23 01:19 EDT 2024. Contains 371906 sequences. (Running on oeis4.)