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 A096225 #9 Sep 20 2016 09:38:44
%S A096225 1,2,3,7,71,6653,25469,15750503
%N A096225 a(0) = 1; for n >= 0, a(n+1) = smallest prime factor of a(n)! + 1.
%e A096225 71!+1 is the product of 6653 and a large prime.
%t A096225 a[1] = 2; a[n_] := Block[{p = PrimePi[a[n - 1]] + 1, r = a[n - 1]! + 1}, While[ Mod[r, Prime[p]] != 0, p++ ]; Prime[p]]; Do[ Print[ a[n]], {n, 7}] (* _Robert G. Wilson v_, Aug 12 2004 *)
%t A096225 NestList[FactorInteger[#!+1][[1,1]]&,1,7] (* _Harvey P. Dale_, Sep 20 2016 *)
%Y A096225 Cf. A002583, A051301.
%K A096225 nonn,more,hard,nice
%O A096225 0,2
%A A096225 _N. J. A. Sloane_, Aug 09 2004
%E A096225 a(6) and a(7) from _Robert G. Wilson v_, Aug 12 2004