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 A092048 #6 Jul 14 2012 11:40:50
%S A092048 1,439,100349,100361,100363,27066991,27067117,1208198633,8179002133
%N A092048 Numbers n such that prime(n) == -6 (mod n).
%t A092048 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == n - 6, Print[n]], {n, 1, 10^9}]
%Y A092048 Cf. A023148, A045924, A092044, A092045, A092046, A092047, A092049, A092050, A092051, A092052.
%K A092048 nonn
%O A092048 1,2
%A A092048 _Robert G. Wilson v_, Feb 18 2004
%E A092048 Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
%E A092048 a(8)-a(9) from _Robert G. Wilson v_, Feb 22 2006