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!)
A166869 a(n) = n * A056219(n+1). 3

%I #14 Sep 08 2022 08:45:48

%S 2,4,12,20,30,54,91,120,171,250,374,504,663,854,1170,1568,2074,2628,

%T 3325,4180,5313,6754,8602,10656,13100,16042,19683,24024,29464,36000,

%U 43834,52768,63228,75582,90510,107856,128575,153178,182208,215400

%N a(n) = n * A056219(n+1).

%H G. C. Greubel, <a href="/A166869/b166869.txt">Table of n, a(n) for n = 1..1000</a>

%p 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*b[n+1], n=1..N); # _G. C. Greubel_, Nov 29 2019

%t 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, max}] (* _G. C. Greubel_, Nov 29 2019 *)

%o (Magma)

%o max:=50;

%o 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)]]) ));

%o [(n-1)*b[n]: n in [2..max-1]]; // _G. C. Greubel_, Nov 29 2019

%o (Sage)

%o max=50;

%o def A056219_list(prec):

%o P.<x> = PowerSeriesRing(ZZ, prec)

%o 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()

%o b=A056219_list(max);

%o [(n-1)*b[n] for n in (2..max)] # _G. C. Greubel_, Nov 29 2019

%Y Cf. A056219, A166870.

%K nonn

%O 1,1

%A _Roger L. Bagula_, Oct 22 2009

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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)