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 A138627 #17 Sep 08 2022 08:45:33
%S A138627 61,163,197,367,401,503,571,673,809,877,911,1013,1217,1319,1489,1523,
%T A138627 1693,1931,1999,2203,2237,2339,2441,2543,2713,2917,3019,3121,3257,
%U A138627 3359,3461,3529,3631,3733,3767,4073,4243,4447,4481,4549,4583,4651,4787,4889,4957
%N A138627 Primes congruent to 10 mod 17.
%H A138627 Vincenzo Librandi, <a href="/A138627/b138627.txt">Table of n, a(n) for n = 1..1000</a>
%F A138627 a(n) ~ 16n log n. - _Charles R Greathouse IV_, Jul 02 2016
%e A138627 17*4-7=61, 17*10-7=163, 17*12-7=197, 17*22-7=367, ...
%t A138627 a={};Do[x=17*n-7;If[PrimeQ[x],AppendTo[a,x]],{n,10^2}];a
%t A138627 Select[Prime[Range[700]], MemberQ[{10}, Mod[#, 17]]&] (* _Vincenzo Librandi_, Aug 15 2012 *)
%t A138627 Select[Range[10,5000,17],PrimeQ] (* _Harvey P. Dale_, Feb 17 2021 *)
%o A138627 (Magma) [p: p in PrimesUpTo(6000) | p mod 17 eq 10 ]; // _Vincenzo Librandi_, Aug 15 2012
%o A138627 (PARI) is(n)=isprime(n) && n%17==10 \\ _Charles R Greathouse IV_, Jul 02 2016
%Y A138627 Cf. A000040.
%K A138627 nonn,easy
%O A138627 1,1
%A A138627 _Vladimir Joseph Stephan Orlovsky_, May 14 2008
%E A138627 More terms from _N. J. A. Sloane_, Jul 11 2008
%E A138627 Edited by _N. J. A. Sloane_ at the suggestion of R. J. Mathar, Jul 20 2008