The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #30 Jun 25 2021 23:16:37
%S 1,12,83,600,3058,18222,130411,783480,3418488,24857930,181308931,
%T 610675758,6529545751,18840405540,102444103996,956394012747,
%U 3188347929974,27288773879397,96923972375603,702926766993950,2980668206142664,20046633698159181,88137290213079355,502113072640777785
%N The number of integers not representable as a sum of n-th powers of primes.
%C 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
%H Mike Oakes, <a href="/A275743/b275743.txt">Table of n, a(n) for n = 1..30</a>
%H S. Boecker and Z. Liptak, <a href="http://www.zaik.uni-koeln.de/AFS/teachings/ss08/InfoSeminar/artikel/money-change.pdf">A Fast and Simple Algorithm for the Money Changing Problem</a>, Algorithmica, 48 (2007), 413-432.
%e For n=2, there are 12 nonnegative integers that cannot be written as a sum of squares of primes.
%Y Cf. A122615, A275746.
%K nonn
%O 1,2
%A _Mike Oakes_, Aug 07 2016
%E More terms from _Mike Oakes_, Aug 17 2016
%E a(16) corrected by _Andrew Howroyd_, Feb 23 2018