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!)
A340978 Number of ways to write n as an ordered sum of 5 positive cubes. 9

%I #9 Feb 02 2021 21:10:11

%S 1,0,0,0,0,0,0,5,0,0,0,0,0,0,10,0,0,0,0,0,0,10,0,0,0,0,5,0,5,0,0,0,0,

%T 20,0,1,0,0,0,0,30,0,0,0,0,0,0,20,0,0,0,0,10,0,5,0,0,0,0,30,0,0,0,5,0,

%U 0,30,0,0,0,20,0,0,10,0,0,0,30,10,0,0,0,0,0,20,20,0,0,0,20,0,5,10

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

%H Robert Israel, <a href="/A340978/b340978.txt">Table of n, a(n) for n = 5..10000</a>

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

%F G.f.: (Sum_{k>=1} x^(k^3))^5.

%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^3), j=1..iroot(n, 3))))

%p end:

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

%p seq(a(n), n=5..97); # _Alois P. Heinz_, Feb 01 2021

%t nmax = 97; CoefficientList[Series[Sum[x^(k^3), {k, 1, Floor[nmax^(1/3)] + 1}]^5, {x, 0, nmax}], x] // Drop[#, 5] &

%Y Cf. A000578, A010057, A025458, A051344, A173679, A280618, A340977, A340979, A340980, A340981, A340982, A340983.

%K nonn

%O 5,8

%A _Ilya Gutkovskiy_, Feb 01 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 25 09:13 EDT 2024. Contains 371967 sequences. (Running on oeis4.)