login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121571 Largest number that is not the sum of n-th powers of distinct primes. 0
0, 6, 17163, 1866000 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

As stated by Sierpinski, H. E. Richert proved a(1)=6. Dressler et al. prove a(2)=17163.

REFERENCES

Robert E. Dressler, Louis Pigno and Robert Young, Sums of squares of primes, Nordisk Mat. Tidskr. 24 (1976), 39-40.

W. Sierpinski, Elementary Theory of Numbers, Warsaw, 1964, p. 143-144.

EXAMPLE

a(1)=6 because only the numbers 1, 4 and 6 are not the sum of distinct primes.

CROSSREFS

Cf. A121518 (numbers that are not the sum of the squares of distinct primes).

Sequence in context: A036773 A007702 A130434 * A123659 A079192 A143780

Adjacent sequences:  A121568 A121569 A121570 * A121572 A121573 A121574

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Aug 08 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.