The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A340955 Number of ways to write n as an ordered sum of 10 nonzero triangular numbers. 9

%I #7 Jan 31 2021 20:25:33

%S 1,0,10,0,45,10,120,90,210,370,297,930,570,1620,1480,2220,3375,2940,

%T 6085,4590,8981,8370,11430,15100,13890,23832,19155,31940,30195,38520,

%U 46890,46440,66550,59400,86355,81532,104220,114390,122410,153450,149490,193440,188010,235350,238840

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

%H Alois P. Heinz, <a href="/A340955/b340955.txt">Table of n, a(n) for n = 10..10000</a>

%F G.f.: (theta_2(sqrt(x)) / (2 * x^(1/8)) - 1)^10, 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, 10):

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

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

%Y Cf. A000217, A010054, A053603, A053604, A226254, A319820, A340949, A340950, A340951, A340952, A340953, A340954.

%K nonn

%O 10,3

%A _Ilya Gutkovskiy_, Jan 31 2021

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 June 7 18:53 EDT 2024. Contains 373206 sequences. (Running on oeis4.)