The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319221 Number of ordered ways of writing n-th triangular number as a sum of n squares. 0
 1, 2, 0, 24, 144, 960, 4608, 74048, 859952, 9568800, 109975680, 1647979872, 23917274304, 358378620704, 5528847787008, 94307761212304, 1632598198916544, 29205907283227776, 538335591996965760, 10388234139989630128, 205386383159397554688, 4173254005731822569088 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA a(n) = [x^(n*(n+1)/2)] theta_3(x)^n, where theta_3() is the Jacobi theta function. a(n) = [x^(n*(n+1)/2)] (Sum_{k=-infinity..infinity} x^(k^2))^n. MATHEMATICA Table[SeriesCoefficient[EllipticTheta[3, 0, x]^n, {x, 0, n (n + 1)/2}], {n, 0, 21}] Join[{1}, Table[SquaresR[n, n (n + 1)/2], {n, 21}]] CROSSREFS Cf. A000217, A000290, A066535, A196010, A232173, A278340, A298858, A299031, A299032. Sequence in context: A012588 A012290 A012591 * A009799 A109582 A308506 Adjacent sequences:  A319218 A319219 A319220 * A319222 A319223 A319224 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Sep 13 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 23 12:53 EDT 2020. Contains 337310 sequences. (Running on oeis4.)