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 A204914 #16 Apr 18 2022 09:46:53 %S A204914 5,21,16,45,40,24,117,112,96,72,165,160,144,120,48,285,280,264,240, %T A204914 168,120,357,352,336,312,240,192,72,525,520,504,480,408,360,240,168, %U A204914 837,832,816,792,720,672,552,480,312,957,952,936,912,840,792,672 %N A204914 Ordered differences of squared primes. %C A204914 For a guide to related sequences, see A204892. %H A204914 Michael S. Branicky, <a href="/A204914/b204914.txt">Table of n, a(n) for n = 1..10000</a> %e A204914 a(1) = s(2) - s(1) = 9 - 4 = 5; %e A204914 a(2) = s(3) - s(1) = 25 - 4 = 21; %e A204914 a(3) = s(3) - s(2) = 25 - 9 = 16; %e A204914 a(4) = s(4) - s(1) = 49 - 4 = 45. %t A204914 (See the program at A204916.) %o A204914 (Python) %o A204914 from math import isqrt %o A204914 from sympy import prime, primerange %o A204914 def aupton(terms): %o A204914 sqps = [p*p for p in primerange(1, prime(isqrt(2*terms)+1)+1)] %o A204914 return [b-a for i, b in enumerate(sqps) for a in sqps[:i]][:terms] %o A204914 print(aupton(52)) # _Michael S. Branicky_, May 21 2021 %Y A204914 Cf. A204908, A204900, A204892. %K A204914 nonn %O A204914 1,1 %A A204914 _Clark Kimberling_, Jan 20 2012