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!)
A279760 Expansion of Product_{k>=1} 1/(1 - x^(prime(k)^3)). 4
1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0
COMMENTS
Number of partitions of n into cubes of primes (A030078).
LINKS
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
FORMULA
G.f.: Product_{k>=1} 1/(1 - x^(prime(k)^3)).
EXAMPLE
a(35) = 1 because we have [27, 8].
For n = 152, there are two solutions: 152 = 5^3 + 3^3 = 19 * 2^3, thus a(152) = 2. This is also the first point where the sequence obtains value larger than one. - Antti Karttunen, Aug 31 2017
MATHEMATICA
nmax = 120; CoefficientList[Series[Product[1/(1 - x^(Prime[k]^3)), {k, 1, nmax}], {x, 0, nmax}], x]
PROG
(PARI) A279760(n, m=8) = { my(s=0, p); if(!n, 1, for(c=m, n, if((ispower(c, 3, &p)&&isprime(p)), s+=A279760(n-c, c))); (s)); }; \\ Antti Karttunen, Aug 31 2017
CROSSREFS
Sequence in context: A015241 A253513 A014025 * A287457 A358777 A359595
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Dec 18 2016
STATUS
approved

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 September 15 23:52 EDT 2024. Contains 375959 sequences. (Running on oeis4.)