The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A173563 Number of positive integers not the sum of distinct positive n-th powers. 1
 0, 31, 2788, 889576, 13912682, 2037573096 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Fuller and Nichols prove that a(6) = 2037573096. - Robert Nichols, Sep 10 2017 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 LINKS C. Fuller and R. H. Nichols Jr., Generalized Anti-Waring Numbers, J. Int. Seq. 18 (2015), #15.10.5. EXAMPLE 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 CROSSREFS Cf. A001661, A001422. Sequence in context: A136245 A262642 A273983 * A190527 A106205 A218424 Adjacent sequences:  A173560 A173561 A173562 * A173564 A173565 A173566 KEYWORD nonn,more,hard AUTHOR R. H. Hardin, Feb 21 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 18 02:58 EDT 2021. Contains 343992 sequences. (Running on oeis4.)