This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A275746 #20 Jun 25 2021 23:16:44 %S A275746 3,62,840,12350,99912,2358913,12173587,120900206,1224812108, %T A275746 20439317893,130357794430,1534358290778,13544972574336, %U A275746 142155007727976,1648210755327790,14816750258004918,151900144117560355,1525977077403654254,16185530587326104490 %N A275746 The number of integers not representable as a sum of n-th powers of odd primes. %C A275746 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 A275746 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 A275746 For n=2, there are 62 integers that cannot be written as a sum of squares of odd primes. %Y A275746 Cf. A275747. For all primes, including 2, see A275743, A122615. %K A275746 nonn %O A275746 1,1 %A A275746 _Mike Oakes_, Aug 07 2016 %E A275746 More terms from _Mike Oakes_, Aug 17 2016