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 A173563 #28 Jun 21 2023 08:02:59 %S A173563 0,31,2788,889576,13912682,2037573096,198526316569 %N A173563 Number of positive integers not the sum of distinct positive n-th powers. %C A173563 Fuller and Nichols prove that a(6) = 2037573096. - _Robert Nichols_, Sep 10 2017 %C A173563 Here, the "sum of n-th powers" includes the case where this sum consists in just one term. (For example, 1 is the sum of just 1^n, for any n; and 4 = 2^2 is considered to be a sum of distinct squares.) - _M. F. Hasler_, May 25 2020 %H A173563 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. %H A173563 Michael J. Wiener, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL26/Wiener/wiener3.html">The Largest Integer Not the Sum of Distinct 8th Powers</a>, J. Integer Sequences, 26 (2023), Article 23.5.4. %e A173563 The list of the a(2) = 31 integers which are not the sum of distinct squares is given in A001422. - _M. F. Hasler_, May 25 2020 %Y A173563 Cf. A001661, A001422. %K A173563 nonn,more,hard %O A173563 1,2 %A A173563 _R. H. Hardin_, Feb 21 2010 %E A173563 a(2..6) confirmed and a(7) added by _Michael J. Wiener_, Jun 18 2023