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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275743 The number of integers not representable as a sum of n-th powers of primes. 4
1, 12, 83, 600, 3058, 18222, 130411, 783480, 3418488, 24857930, 181308931, 610675758, 6529545751, 18840405540, 102444103996, 956394012747, 3188347929974, 27288773879397, 96923972375603, 702926766993950, 2980668206142664, 20046633698159181, 88137290213079355, 502113072640777785 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

I executed the algorithm in Boecker et al. (2007) with a pari-GP program, which needed 34 GB RAM and 2 hours to run for n=30. Results checked by an independent algorithm. - Mike Oakes, Aug 17 2016

LINKS

Mike Oakes, Table of n, a(n) for n = 1..30

S. Boecker and Z. Liptak, A Fast and Simple Algorithm for the Money Changing Problem, Algorithmica, 48 (2007), 413-432.

EXAMPLE

For n=2, there are 12 nonnegative integers that cannot be written as a sum of squares of primes.

CROSSREFS

Cf. A122615, A275746.

Sequence in context: A175037 A252179 A102105 * A026949 A165127 A213347

Adjacent sequences:  A275740 A275741 A275742 * A275744 A275745 A275746

KEYWORD

nonn

AUTHOR

Mike Oakes, Aug 07 2016

EXTENSIONS

More terms from Mike Oakes, Aug 17 2016

a(16) corrected by Andrew Howroyd, Feb 23 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 16:17 EDT 2019. Contains 328223 sequences. (Running on oeis4.)