|
%I #20 Jun 25 2021 23:16:44
%S 3,62,840,12350,99912,2358913,12173587,120900206,1224812108,
%T 20439317893,130357794430,1534358290778,13544972574336,
%U 142155007727976,1648210755327790,14816750258004918,151900144117560355,1525977077403654254,16185530587326104490
%N The number of integers not representable as a sum of n-th powers of odd primes.
%C 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
%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 62 integers that cannot be written as a sum of squares of odd primes.
%Y Cf. A275747. For all primes, including 2, see A275743, A122615.
%K nonn
%O 1,1
%A _Mike Oakes_, Aug 07 2016
%E More terms from _Mike Oakes_, Aug 17 2016
|
