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 A090475 #13 Jul 06 2015 14:51:03
%S A090475 2,3,5,29,2609,2269829,20608503836279,3397683442959574948323216959,
%T A090475 42930190020276065993287927763424183433168916230440704129,
%U A090475 1192530198055712826264639739575734950954723597893286538562918677849035900498296709057759892487138176511608345909
%N A090475 Beginning with 2, a(n+1) is the least prime == -1 (mod Product_{i=1..n} a(i) ).
%o A090475 (PARI) terms=12; p=2; print1("2, "); for(n=2, terms, q=p-1; while(!ispseudoprime(q), q=q+p); print1(q, ", "); p=p*q) \\ _Serge Batalov_, May 22 2015
%Y A090475 Cf. A090474, A090476, A071580, A258081.
%K A090475 nonn
%O A090475 1,1
%A A090475 _Amarnath Murthy_, Dec 02 2003
%E A090475 Corrected and extended by _David Wasserman_, Nov 16 2005