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 A256564 #6 Apr 03 2015 09:09:58 %S A256564 1,2,2,3,2,7,2,5,2,11,2,3,2,3,2,13,3,2,19,2,17,2,23,2,3,2,3,2,5,3,2, %T A256564 37,2,5,2,3,2,31,2,29,2,41,2,43,2,3,2,47,2,7,2,3,2,53,2,5,2,3,2,59,2, %U A256564 61,2,3,2,5,2,67,2,3,2,79,2,7,2,3,2,73,2,71 %N A256564 Smallest prime factor of A166133(n). %C A256564 a(n) = A020639(A166133(n)). %H A256564 Reinhard Zumkeller, <a href="/A256564/b256564.txt">Table of n, a(n) for n = 1..10000</a> %o A256564 (Haskell) %o A256564 a256564 = a020639 . a166133 %Y A256564 Cf. A166133, A020639, A244080. %K A256564 nonn,look %O A256564 1,2 %A A256564 _Reinhard Zumkeller_, Apr 02 2015