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 A113169 #16 Apr 03 2023 10:36:11 %S A113169 3,5,17,29,47,53,59,113,137,173,227,239,257,269,347,353,389,419,449, %T A113169 467,479,509,557,563,599,677,719,743,827,839,953,977,983,1013,1019, %U A113169 1103,1109,1163,1193,1217,1223,1259,1277,1289,1307,1373,1427,1487 %N A113169 Primes p such that 13*p + 2 is also prime. %C A113169 Except for 3, all terms == 5 (mod 6). - _Robert Israel_, Sep 06 2018 %H A113169 Robert Israel, <a href="/A113169/b113169.txt">Table of n, a(n) for n = 1..10000</a> %H A113169 Chris Caldwell <a href="https://t5k.org/lists/small/1000.txt">The First 1000 Primes</a>. %e A113169 If p=173 then 13*p + 2 = 2251 (prime). %p A113169 select(t -> isprime(t) and isprime(13*t+2), [3,seq(i,i=5..10000,6)]); # _Robert Israel_, Sep 06 2018 %o A113169 (Magma) [p: p in PrimesUpTo(3000)| IsPrime(13*p+2)] // _Vincenzo Librandi_, Jan 29 2011 %o A113169 (PARI) forprime(p=3, 1e4, if(isprime(13*p+2), print1(p, ", "))); \\ _Altug Alkan_, Sep 07 2018 %Y A113169 Cf. A113151, A113115. %K A113169 nonn %O A113169 1,1 %A A113169 _Parthasarathy Nambi_, Jan 06 2006