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 A116659 #16 Feb 11 2021 22:56:12
%S A116659 1,3,9,23,81,85,87,16057,4124457,27067011,27067127,1208198605,
%T A116659 1208198851
%N A116659 Numbers k such that prime(k) == 14 (mod k).
%C A116659 Starting with a(4), positions of 14 in A004648. - _Robert G. Wilson v_, Feb 22 2006, corrected by _Eric M. Schmidt_, Feb 05 2013
%t A116659 NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 14, Print[n]], {n, 10^9}] (* _Robert G. Wilson v_ *)
%o A116659 (Sage)
%o A116659 def A116659(max) :
%o A116659 terms = []
%o A116659 p = 2
%o A116659 for n in range(1, max+1) :
%o A116659 if (p - 14) % n == 0 : terms.append(n)
%o A116659 p = next_prime(p)
%o A116659 return terms
%o A116659 # _Eric M. Schmidt_, Feb 05 2013
%Y A116659 Cf. A004648; A023143 - A023152, A116657, A116677, A116658, A116659: prime(n) == m (mod n), m=1..14.
%K A116659 nonn
%O A116659 1,2
%A A116659 _Zak Seidov_, Feb 21 2006
%E A116659 a(9)-a(13) from _Robert G. Wilson v_, Feb 22 2006
%E A116659 First three terms inserted by _Eric M. Schmidt_, Feb 05 2013