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 A065516 #27 Dec 26 2020 02:10:36
%S A065516 2,3,1,4,1,6,1,3,1,7,1,1,3,1,7,3,2,4,2,1,4,3,4,5,3,5,3,1,1,4,2,1,1,11,
%T A065516 5,4,3,1,2,1,1,6,4,1,7,1,1,2,1,9,3,1,2,5,3,8,1,5,2,2,7,7,1,1,2,1,3,4,
%U A065516 1,1,2,1,1,2,5,9,2,10,2,4,1,5,3,3,2,7,4,9,2,2,4,3,1,2,1,1,2,4,5,5,2,2,3,1,2
%N A065516 Differences between products of 2 primes.
%C A065516 See A215231 and A085809 for record values and where they occur: A215231(n) = a(A085809(n)). - _Reinhard Zumkeller_, Mar 23 2014
%H A065516 T. D. Noe, <a href="/A065516/b065516.txt">Table of n, a(n) for n=1..10000</a>
%F A065516 a(n) = A001358(n+1) - A001358(n).
%e A065516 a(6) = A001358(7) - A001358(6) = 21 - 15 = 6.
%t A065516 Differences[Select[Range[329], PrimeOmega[#] == 2 &]] (* _Arkadiusz Wesolowski_, Nov 24 2011 *)
%o A065516 (PARI) {spg(m)=local(a,b); a=0; b=4; for(n=5,m,if(bigomega(n) == 2,a=n; print1(a-b","); b=a; ))}
%o A065516 (Haskell)
%o A065516 a065516 n = a065516_list !! (n-1)
%o A065516 a065516_list = zipWith (-) (tail a001358_list) a001358_list
%o A065516 -- _Reinhard Zumkeller_, Mar 23 2014
%Y A065516 A166237 is the version for distinct primes.
%Y A065516 Cf. A001358, A239656.
%K A065516 easy,nonn
%O A065516 1,1
%A A065516 _Lior Manor_, Nov 27 2001
%E A065516 More terms from _Jason Earls_, Jul 24 2003