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!)
A340949 Number of ways to write n as an ordered sum of 4 nonzero triangular numbers. 10

%I #8 Jan 31 2021 20:17:14

%S 1,0,4,0,6,4,4,12,1,16,6,16,12,12,22,8,36,4,30,24,21,36,18,36,28,48,

%T 16,44,36,44,48,36,46,40,72,20,73,48,54,72,42,68,56,84,50,72,78,56,84,

%U 84,62,112,60,60,110,84,97,72,120,76,116,84,72,144,102,104,96,108,102,156,102,92

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

%H Alois P. Heinz, <a href="/A340949/b340949.txt">Table of n, a(n) for n = 4..10000</a>

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

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

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

%Y Cf. A000217, A008438, A010054, A053603, A053604, A319814, A340950, A340951, A340952, A340953, A340954, A340955.

%K nonn

%O 4,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 April 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)