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 A243200 #11 Jun 11 2014 21:32:56 %S A243200 0,1,1,3,1,1,1,3,4,4,3,2,2,6,6,5,1,1,5,2,2,2,10,5,5,3,3,3,2,2,2,1,1,1, %T A243200 3,2,2,5,1,1,3,3,3,3,6,7,4,1,1,1,1,1,4,4,1,1,1,1,3,3,3,1,1,1,2,2,2,2, %U A243200 2,2,8,6,6,6,1,1,1,1,1,1,7,1,1,1,4,2,2 %N A243200 Let A242720(n)-3 = prime(l)*prime(m), l<=m; a(n)=m-l. %C A243200 Since for a prime p>3, p^2 == 1 (mod 3), then for n>2, A242720(n) is not equal to p^2 + 3 (otherwise, lpf(A242720(n) - 1) = 3). So, the sequence has only zero term a(2). %Y A243200 Cf. A242720, A242719, A243154, A243158. %K A243200 nonn %O A243200 2,4 %A A243200 _Vladimir Shevelev_, Jun 01 2014 %E A243200 More terms from _Peter J. C. Moses_, Jun 01 2014