A340915 Number of ways to write n as an ordered sum of 8 squares of positive integers.
1, 0, 0, 8, 0, 0, 28, 0, 8, 56, 0, 56, 70, 0, 168, 64, 28, 280, 84, 168, 280, 176, 420, 224, 345, 560, 392, 616, 420, 848, 924, 336, 1246, 1064, 868, 1464, 988, 1680, 1820, 1120, 1904, 2464, 1932, 1904, 2870, 2752, 2772, 2912, 2892, 4256, 3640, 3248, 4480, 5040, 4760, 3696, 6120
Offset: 8
Keywords
Links
Crossrefs
Programs
-
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, 8): seq(a(n), n=8..64); # Alois P. Heinz, Jan 31 2021
-
Mathematica
nmax = 64; CoefficientList[Series[(EllipticTheta[3, 0, x] - 1)^8/256, {x, 0, nmax}], x] // Drop[#, 8] &
Formula
G.f.: (theta_3(x) - 1)^8 / 256, where theta_3() is the Jacobi theta function.