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 A275743 #30 Jun 25 2021 23:16:37 %S A275743 1,12,83,600,3058,18222,130411,783480,3418488,24857930,181308931, %T A275743 610675758,6529545751,18840405540,102444103996,956394012747, %U A275743 3188347929974,27288773879397,96923972375603,702926766993950,2980668206142664,20046633698159181,88137290213079355,502113072640777785 %N A275743 The number of integers not representable as a sum of n-th powers of primes. %C A275743 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 A275743 Mike Oakes, <a href="/A275743/b275743.txt">Table of n, a(n) for n = 1..30</a> %H A275743 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 A275743 For n=2, there are 12 nonnegative integers that cannot be written as a sum of squares of primes. %Y A275743 Cf. A122615, A275746. %K A275743 nonn %O A275743 1,2 %A A275743 _Mike Oakes_, Aug 07 2016 %E A275743 More terms from _Mike Oakes_, Aug 17 2016 %E A275743 a(16) corrected by _Andrew Howroyd_, Feb 23 2018