Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121571
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121571 Largest number that is not the sum of n-th powers of distinct primes. +0
1
0, 6, 17163, 1866000 (list; graph; listen)
OFFSET

0,2

COMMENT

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 this_sequence A123659 A079192 A143780

Adjacent sequences: A121568 A121569 A121570 this_sequence A121572 A121573 A121574

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 08:23 EST 2009. Contains 170348 sequences.


AT&T Labs Research