

A173563


Number of positive integers not the sum of distinct positive nth powers.


1




OFFSET

1,2


COMMENTS

Fuller and Nichols prove that a(6) = 2037573096.  Robert Nichols, Sep 10 2017
Here, the "sum of nth 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

Table of n, a(n) for n=1..6.
C. Fuller and R. H. Nichols Jr., Generalized AntiWaring 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



