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 A057326 #30 Sep 08 2022 08:45:02 %S A057326 2,19,79,331,439,499,619,829,1069,1279,1531,2089,2131,2179,2311,2791, %T A057326 3019,3061,3109,3181,3769,4159,4231,4261,4621,4639,4861,4951,5419, %U A057326 5749,6121,6211,6709,6841,7369,7411,7561,7639,8209,8629,9109,9199,9319,9739,10321,10831 %N A057326 First member of a prime triple in a 2p-1 progression. %C A057326 Numbers n such that n remains prime through 2 iterations of function f(x) = 2x - 1. %H A057326 Vincenzo Librandi, <a href="/A057326/b057326.txt">Table of n, a(n) for n = 1..2100</a> %H A057326 <a href="/index/Pri#primes_AP">Index entries for sequences related to primes in arithmetic progressions</a> %e A057326 Triplets are (2,3,5), (19,37,73), (79,157,313), (331,661,1321), ... %p A057326 select(p -> andmap(isprime,[p, 2*p-1, 4*p-3]), [seq(p, p=0..10000)]); # _K. D. Bajpai_, Jun 26 2017 %t A057326 Select[Prime[Range[1500]],And@@PrimeQ[NestList[2#-1&,#,2]]&] (* _Harvey P. Dale_, Dec 09 2011 *) %o A057326 (PARI) forprime(p= 1, 100000, if(isprime(2*p-1) && isprime(4*p-3), print1(p, ", "))); \\ _K. D. Bajpai_, Jun 26 2017 %o A057326 (Magma) [p: p in PrimesUpTo (10000) | IsPrime(2*p-1) and IsPrime(4*p-3)]; // _K. D. Bajpai_, Jun 26 2017 %Y A057326 Cf. (A005382 and A005383), A057327, A057328, A057329, A057330, A005603. %K A057326 nonn %O A057326 1,1 %A A057326 _Patrick De Geest_, Aug 15 2000 %E A057326 Offset set to 1 by _Michel Marcus_, Jul 02 2017