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!)
A340481 Number of ways to write n as an ordered sum of 5 squares of positive integers. 10

%I #14 Aug 09 2021 08:48:18

%S 1,0,0,5,0,0,10,0,5,10,0,20,5,0,30,6,10,20,20,30,5,30,30,20,35,10,60,

%T 45,0,60,50,30,45,50,60,70,35,30,110,50,31,110,80,80,50,70,120,70,75,

%U 90,140,110,20,140,160,60,135,120,120,180,40,130,230,80,120,170,200,155,85,200,190

%N Number of ways to write n as an ordered sum of 5 squares of positive integers.

%H Alois P. Heinz, <a href="/A340481/b340481.txt">Table of n, a(n) for n = 5..20000</a>

%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>

%F G.f.: (theta_3(x) - 1)^5 / 32, where theta_3() is the Jacobi theta function.

%p b:= proc(n, t) option remember;

%p `if`(n=0, `if`(t=0, 1, 0), `if`(t<1, 0, add((s->

%p `if`(s>n, 0, b(n-s, t-1)))(j^2), j=1..isqrt(n))))

%p end:

%p a:= n-> b(n, 5):

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

%t nmax = 75; CoefficientList[Series[(EllipticTheta[3, 0, x] - 1)^5/32, {x, 0, nmax}], x] // Drop[#, 5] &

%Y Cf. A000132, A000290, A010052, A025429, A038671, A063691, A063725, A063730, A340905, A340906, A340915, A340946, A340947.

%Y Column k=5 of A337165.

%K nonn,look

%O 5,4

%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 23 09:22 EDT 2024. Contains 371905 sequences. (Running on oeis4.)