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 A256368 #15 Aug 01 2019 03:47:11 %S A256368 2,3,2,3,2,5,2,5,2,5,2,7,2,7,2,3,2,3,11,13,11,13,3,2,3,2,17,2,17,2,5, %T A256368 2,5,2,13,2,7,2,7,19,3,19,2,19,2,3,2,23,2,23,2,5,2,3,2,3,2,29,31,29, %U A256368 31,2,3,2,11,2,7,2 %N A256368 Primes arising from A098550(n), n >= 2, as smallest prime factor of gcd(A098550(n), A098550(n+2)). %C A256368 Conjecture: the sequence contains all primes such that the first appearances of them are in the nature order. %H A256368 Peter J. C. Moses, <a href="/A256368/b256368.txt">Table of n, a(n) for n = 2..1001</a> %Y A256368 Cf. A098550, A256189, A256366. %K A256368 nonn %O A256368 2,1 %A A256368 _Vladimir Shevelev_, Mar 26 2015