Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122615
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122615 Largest integer which cannot be written as a sum of n-th powers of primes. +0
1
0, 1, 23, 154 (list; graph; listen)
OFFSET

0,3

EXAMPLE

a(0) = 0 because all positive integers can be written as a sum of 0th powers of primes, i.e. as sums of 1.

a(1) = 1 because 2^1 = 2, 3^1 = 3, hence all positive integers 2 or larger can be written as a*2 + b*3 for a,b nonnegative integers [2 = 2, 3 = 3, 4 = 2+2, 5 = 2+3, 6 = 2+2+2 = 3+3, 7 = 2+2+3,...].

a(2) = 23 because all integers 24 or larger can be written as a sum of squares and in fact as a sum of squares of primes.

a(3) = 154 because all integers 155 or larger can be written as a sum of cubes of primes.

CROSSREFS

Cf. A078135.

Sequence in context: A142044 A142935 A037068 this_sequence A122162 A133253 A098713

Adjacent sequences: A122612 A122613 A122614 this_sequence A122616 A122617 A122618

KEYWORD

bref,nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Sep 20 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 18 21:37 EST 2009. Contains 171024 sequences.


AT&T Labs Research