login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of ways to write n as an ordered sum of 7 nonzero triangular numbers.
9

%I #8 Jan 31 2021 20:22:03

%S 1,0,7,0,21,7,35,42,35,112,42,182,112,210,260,217,462,252,651,399,728,

%T 777,672,1232,749,1533,1127,1659,1617,1792,2289,1890,2926,2212,3339,

%U 2990,3584,3654,4046,4613,4263,5754,4487,6636,5733,6825,7014,7203,8617,7560,10087,8302

%N Number of ways to write n as an ordered sum of 7 nonzero triangular numbers.

%H Alois P. Heinz, <a href="/A340952/b340952.txt">Table of n, a(n) for n = 7..10000</a>

%F G.f.: (theta_2(sqrt(x)) / (2 * x^(1/8)) - 1)^7, where theta_2() is the Jacobi theta function.

%p b:= proc(n, k) option remember; local r, t, d; r, t, d:= $0..2;

%p if n=0 then `if`(k=0, 1, 0) else

%p while t<=n do r:= r+b(n-t, k-1); t, d:= t+d, d+1 od; r fi

%p end:

%p a:= n-> b(n, 7):

%p seq(a(n), n=7..58); # _Alois P. Heinz_, Jan 31 2021

%t nmax = 58; CoefficientList[Series[(EllipticTheta[2, 0, Sqrt[x]]/(2 x^(1/8)) - 1)^7, {x, 0, nmax}], x] // Drop[#, 7] &

%Y Cf. A000217, A010054, A053603, A053604, A226252, A319817, A340949, A340950, A340951, A340953, A340954, A340955.

%K nonn

%O 7,3

%A _Ilya Gutkovskiy_, Jan 31 2021