1,1

Equivalent to primes which can be written as the sum of cubes of primes; the question being "what is the minimum number of terms in such sums when they can be written in more than one way? - Jonathan Vos Post (jvospost3(AT)gmail.com), Sep 21 2006

Mikawa and Peneva: "One of the famous and still unsettled problems in additive prime number theory is the conjecture that every sufficiently large integer satisfying some natural congruence conditions, can be written as the sum of four cubes of primes. Although the present methods lack the power to prove such a strong result, Hua... has been able to prove that every sufficiently large odd integer as the sum of nine cubes of primes. He also established that almost all integers {n == 1 mod 2, n =/= 0, +/-2 mod 9, n =/= 0 mod 7} can be expressed as the sum of five cubes of primes." - Jonathan Vos Post (jvospost3(AT)gmail.com), Sep 21 2006

Eric Weisstein's World of Mathematics, Cubic Number.

Index entries for sequences related to sums of cubes

Hiroshi Mikawa and Temenoujka Peneva, Sums of Five Cubes of Primes in Short Intervals.

A000040(25) = 97 = 3^3 + 3^3 + 3^3 + 2^3 + 2^3, therefore 97 is a term.

Cf. A000578, A078128, A078133, A000040, A078138.

Primes in A122612.

Sequence in context: A156252 A166491 A127880 this_sequence A115404 A033223 A064508

Adjacent sequences: A078129 A078130 A078131 this_sequence A078133 A078134 A078135

nonn

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 19 2002