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 A092052 #5 Feb 23 2020 17:42:22
%S A092052 1,3,437,2639,4124589,27067013,27067101,27067139,27067271,
%T A092052 382465573551,18262325820327,18262325820329,18262325820333,
%U A092052 885992692751831,6201265271239783,6201265271239997,6201265271240071,6201265271240403,306268030480171331
%N A092052 Numbers n such that prime(n) == -10 (mod n).
%t A092052 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == n - 10, Print[n]], {n, 1, 10^9}]
%Y A092052 Cf. A023152, A045924, A092044, A092045, A092046, A092047, A092048, A092049, A092050, A092051.
%K A092052 nonn,more
%O A092052 1,2
%A A092052 _Robert G. Wilson v_, Feb 18 2004
%E A092052 Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004
%E A092052 a(10)-a(19) from _Giovanni Resta_, Feb 23 2020