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 A092044 #11 Feb 23 2020 08:42:20
%S A092044 1,11,71,637319,637323,637327,179993015,1208198861,8179002163,
%T A092044 8179002189,55762149067,55762149103,6201265271239787,
%U A092044 43525513764814971,43525513764815121,2159986889494444325,2159986889494445481,2159986889494445499,2159986889494447181
%N A092044 Numbers n such that prime(n) == -2 (mod n).
%t A092044 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == n - 2, Print[n]], {n, 1, 10^9}]
%o A092044 (PARI) for(i=1,10^9,if(Mod(prime(i),i)==-2,print1(i,",")));
%Y A092044 Cf. A023144, A045924, A092045, A092046, A092047, A092048, A092049, A092050, A092051, A092052.
%Y A092044 Cf. A105290.
%K A092044 nonn
%O A092044 1,2
%A A092044 _Robert G. Wilson v_, Feb 18 2004
%E A092044 Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
%E A092044 a(7)-a(12) from _Robert G. Wilson v_, Feb 22 2006
%E A092044 a(13)-a(19) from _Giovanni Resta_, Feb 23 2020