This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A018889 #37 Feb 16 2025 08:32:33
%S A018889 15,22,50,114,167,175,186,212,231,238,303,364,420,428,454
%N A018889 Numbers whose shortest representation as a sum of positive cubes requires exactly 8 cubes.
%C A018889 Wieferich proved that 167 is the unique prime in this sequence. - _Jonathan Vos Post_, Sep 23 2006
%D A018889 Joe Roberts, Lure of the Integers, entry 239.
%H A018889 Jan Bohman and Carl-Erik Froberg, <a href="http://dx.doi.org/10.1007/BF01934077">Numerical investigation of Waring's problem for cubes</a>, Nordisk Tidskr. Informationsbehandling (BIT) 21 (1981), 118-122.
%H A018889 G. L. Honaker, Jr. and Chris Caldwell, et al., <a href="https://t5k.org/curios/page.php?short=167">A Prime Curios Page</a>.
%H A018889 K. S. McCurley, <a href="http://dx.doi.org/10.1016/0022-314X(84)90100-8">An effective seven-cube theorem</a>, J. Number Theory, 19 (1984), 176-183.
%H A018889 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CubicNumber.html">Cubic Number</a>
%H A018889 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Warings Problem</a>
%H A018889 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a>
%t A018889 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 *)
%Y A018889 Subsequence of A018888.
%K A018889 nonn,fini,full
%O A018889 1,1
%A A018889 Anonymous
%E A018889 Corrected by Arlin Anderson.
%E A018889 Additional comments from _Jud McCranie_.
%E A018889 Edited by _N. J. A. Sloane_, Aug 10 2022