login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A018889
Numbers whose shortest representation as a sum of positive cubes requires exactly 8 cubes.
9
15, 22, 50, 114, 167, 175, 186, 212, 231, 238, 303, 364, 420, 428, 454
OFFSET
1,1
COMMENTS
Wieferich proved that 167 is the unique prime in this sequence. - Jonathan Vos Post, Sep 23 2006
REFERENCES
Joe Roberts, Lure of the Integers, entry 239.
LINKS
Jan Bohman and Carl-Erik Froberg, Numerical investigation of Waring's problem for cubes, Nordisk Tidskr. Informationsbehandling (BIT) 21 (1981), 118-122.
G. L. Honaker, Jr. and Chris Caldwell, et al., A Prime Curios Page.
K. S. McCurley, An effective seven-cube theorem, J. Number Theory, 19 (1984), 176-183.
Eric Weisstein's World of Mathematics, Cubic Number
Eric Weisstein's World of Mathematics, Warings Problem
MATHEMATICA
max = 500; nn = Union[(#*#).# & /@ Tuples[Range[0, 7], {7}]][[1 ;; max]]; Select[{#, PowersRepresentations[#, 8, 3]} & /@ Complement[Range[max], nn] , #[[2]] != {} &][[All, 1]] (* Jean-François Alcover, Jul 21 2011 *)
CROSSREFS
Subsequence of A018888.
Sequence in context: A006615 A114867 A109288 * A186525 A236107 A065728
KEYWORD
nonn,fini,full
AUTHOR
Anonymous
EXTENSIONS
Corrected by Arlin Anderson.
Additional comments from Jud McCranie.
Edited by N. J. A. Sloane, Aug 10 2022
STATUS
approved