|
%I #10 Sep 18 2017 02:58:19
%S 0,8,27,35,125,133,152,160,343,351,370,378,468,476,495,503,1331,1339,
%T 1358,1366,1456,1464,1483,1491,1674,1682,1701,1709,1799,1807,1826,
%U 1834,2197,2205,2224,2232,2322,2330,2349,2357,2540,2548,2567,2575,2665,2673,2692
%N Numbers that are the sum of cubes of distinct primes.
%C The complement of this sequence is conjectured to have 483370 terms, the last one being 1866000 = A121571(3).
%C This conjecture was proved by Fuller and Nichols (see the link). - _Robert Nichols_, Sep 17 2017
%H T. D. Noe, <a href="/A213519/b213519.txt">Table of n, a(n) for n = 1..10000</a>
%H C. Fuller and R. H. Nichols Jr., <a href="https://cs.uwaterloo.ca/journals/JIS/VOL18/Fuller/fuller2.html">Generalized Anti-Waring Numbers</a>, J. Int. Seq. 18, 2015, #15.10.5.
%t lim = PrimePi[17]; s = {0}; Do[p = Prime[n]; s = Union[s, s + p^3], {n, lim}]; Select[s, # <= Prime[lim]^3 &]
%Y Cf. A121571.
%K nonn,easy
%O 1,2
%A _T. D. Noe_, Jul 10 2012
|
