A173563 Number of positive integers not the sum of distinct positive n-th powers.

0, 31, 2788, 889576, 13912682, 2037573096, 198526316569

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

Table of n, a(n) for n=1..7.

C. Fuller and R. H. Nichols Jr., Generalized Anti-Waring Numbers, J. Int. Seq. 18 (2015), #15.10.5.

Michael J. Wiener, The Largest Integer Not the Sum of Distinct 8th Powers, J. Integer Sequences, 26 (2023), Article 23.5.4.

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

Extensions

a(2..6) confirmed and a(7) added by Michael J. Wiener, Jun 18 2023

Status

approved