[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
login
A340946
Number of ways to write n as an ordered sum of 9 squares of positive integers.
11
1, 0, 0, 9, 0, 0, 36, 0, 9, 84, 0, 72, 126, 0, 252, 135, 36, 504, 156, 252, 630, 288, 756, 576, 606, 1260, 756, 1207, 1260, 1584, 2052, 1008, 2727, 2688, 1764, 3663, 2718, 3816, 4608, 2853, 5418, 6048, 4620, 5868, 7506, 7464, 7308, 8442, 8958, 11088, 10404, 9684, 13986, 14184, 13020
OFFSET
9,4
FORMULA
G.f.: (theta_3(x) - 1)^9 / 512, where theta_3() is the Jacobi theta function.
MAPLE
b:= proc(n, t) option remember;
`if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add((s->
`if`(s>n, 0, b(n-s, t-1)))(j^2), j=1..isqrt(n))))
end:
a:= n-> b(n, 9):
seq(a(n), n=9..63); # Alois P. Heinz, Jan 31 2021
MATHEMATICA
nmax = 63; CoefficientList[Series[(EllipticTheta[3, 0, x] - 1)^9/512, {x, 0, nmax}], x] // Drop[#, 9] &
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jan 31 2021
STATUS
approved