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
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