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 A069136 #14 Sep 21 2017 09:03:16 %S A069136 6,7,13,14,15,20,21,22,23,34,39,41,42,46,47,48,49,50,53,58,60,61,69, %T A069136 76,77,79,84,85,86,87,95,98,102,103,104,105,106,110,111,112,113,114, %U A069136 117,121,122,123,124,132,139,140,147,148,151,158,159,165 %N A069136 Numbers that are not the sum of 5 nonnegative cubes. %C A069136 Sequence is conjectured to be finite. %C A069136 Comment from Richard C. Schroeppel, Sep 22 2010: It is conjectured that 7373170279850 is the largest number requiring more than four cubes (see Deshouillers et al.). %D A069136 Bohman, Jan and Froberg, Carl-Erik; Numerical investigation of Waring's problem for cubes, Nordisk Tidskr. Informationsbehandling (BIT) 21 (1981), 118-122. %D A069136 F. Romani, Computations concerning Waring's problem, Calcolo, 19 (1982), 415-431. %H A069136 T. D. Noe, <a href="/A069136/b069136.txt">Table of n, a(n) for n=1..4060</a> %H A069136 Jean-Marc Deshouillers, Francois Hennecart and Bernard Landreau; appendix by I. Gusti Putu Purnaba, <a href="http://www.ams.org/mcom/2000-69-229/">7373170279850</a>, Math. Comp. 69 (2000), 421-439. %H A069136 <a href="/index/Su#ssq">Index entries for sequences related to sums of cubes</a> %Y A069136 Sums of k cubes, number of ways of writing n as, for k=1..9: A010057, A173677, A051343, A173678, A173679, A173680, A173676, A173681, A173682. %K A069136 nonn %O A069136 1,1 %A A069136 _N. J. A. Sloane_, Apr 08 2002