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 A142160 #26 Apr 30 2025 09:17:05
%S A142160 2,41,197,353,431,509,587,743,821,977,1289,1367,1523,1601,1913,2069,
%T A142160 2381,2459,2693,2927,3083,3863,4019,4253,4409,4643,4721,4799,4877,
%U A142160 5189,5501,5657,5813,6047,6203,6359,6827,6983,7451,7529,7607,7841,7919,8231,8387
%N A142160 Primes congruent to 2 mod 39.
%C A142160 a(4)..a(7) are the first set of 4 prime-indexed primes in arithmetic progression: a(4) = 353 = prime(prime(20)); a(5) = 431 = prime(prime(23)); a(6) = 509 = prime(prime(25)); a(7) = 587 = prime(prime(28)). Then we can see that 431-353 = 509-431 = 587-509 = 78. - _Bobby Jacobs_, Nov 30 2016
%C A142160 2 and primes congruent to 41 mod 78. - _Chai Wah Wu_, Apr 29 2025
%H A142160 Vincenzo Librandi, <a href="/A142160/b142160.txt">Table of n, a(n) for n = 1..1000</a>
%F A142160 a(n) ~ 24n log n. - _Charles R Greathouse IV_, Jul 03 2016
%t A142160 Select[Prime[Range[3000]],MemberQ[{2},Mod[#,39]]&] (* _Vincenzo Librandi_, Aug 19 2012 *)
%t A142160 Select[Range[2,9000,39],PrimeQ] (* _Harvey P. Dale_, Oct 21 2014 *)
%o A142160 (Magma)[p: p in PrimesUpTo(9000) | p mod 39 eq 2 ]; // _Vincenzo Librandi_, Aug 19 2012
%o A142160 (PARI) is(n)=isprime(n) && n%39==2 \\ _Charles R Greathouse IV_, Jul 03 2016
%Y A142160 Cf. A000040.
%K A142160 nonn,easy
%O A142160 1,1
%A A142160 _N. J. A. Sloane_, Jul 11 2008