A275746 The number of integers not representable as a sum of n-th powers of odd primes.

3, 62, 840, 12350, 99912, 2358913, 12173587, 120900206, 1224812108, 20439317893, 130357794430, 1534358290778, 13544972574336, 142155007727976, 1648210755327790, 14816750258004918, 151900144117560355, 1525977077403654254, 16185530587326104490

Offset: 1

Author

Mike Oakes, Aug 07 2016

Keywords

• nonn

Comments

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

Examples

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

Links

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

Crossrefs

Cf. A275747. For all primes, including 2, see A275743, A122615.

Extensions

More terms from Mike Oakes, Aug 17 2016