cp's OEIS Frontend

A007811 Numbers k for which 10k+1, 10k+3, 10k+7 and 10k+9 are primes.

%I A007811 #65 Jul 07 2024 21:05:29
%S A007811 1,10,19,82,148,187,208,325,346,565,943,1300,1564,1573,1606,1804,1891,
%T A007811 1942,2101,2227,2530,3172,3484,4378,5134,5533,6298,6721,6949,7222,
%U A007811 7726,7969,8104,8272,8881,9784,9913,10111,10984,11653,11929,12220,13546,14416,15727
%N A007811 Numbers k for which 10k+1, 10k+3, 10k+7 and 10k+9 are primes.
%H A007811 Charles R Greathouse IV, <a href="/A007811/b007811.txt">Table of n, a(n) for n = 1..10000</a>
%F A007811 a(n) = 3*A014561(n) + 1. - _Zak Seidov_, Sep 21 2009
%p A007811 for n from 1 to 10000 do m := 10*n: if isprime(m+1) and isprime(m+3) and isprime(m+7) and isprime(m+9) then print(n); fi: od: quit
%t A007811 Select[ Range[ 1, 10000, 3 ], PrimeQ[ 10*#+1 ] && PrimeQ[ 10*#+3 ] && PrimeQ[ 10*#+7 ] && PrimeQ[ 10*#+9 ]& ]
%t A007811 Select[Range[15000], And @@ PrimeQ /@ ({1, 3, 7, 9} + 10#) &] (* _Ray Chandler_, Jan 12 2007 *)
%o A007811 (Magma) [n: n in [0..10000] | forall{10*n+r: r in [1,3,7,9] | IsPrime(10*n+r)}]; // _Bruno Berselli_, Sep 04 2012
%o A007811 (PARI) p=2;q=3;r=5;forprime(s=7,1e5,if(s-p==8 && r-p==6 && q-p==2 && p%10==1, print1(p", ")); p=q;q=r;r=s) \\ _Charles R Greathouse IV_, Mar 21 2013
%o A007811 (Haskell)
%o A007811 a007811 n = a007811_list !! (n-1)
%o A007811 a007811_list = map (pred . head) $ filter (all (== 1) . map a010051') $
%o A007811    iterate (zipWith (+) [10, 10, 10, 10]) [1, 3, 7, 9]
%o A007811 -- _Reinhard Zumkeller_, Jul 18 2014
%o A007811 (Perl) use ntheory ":all"; my @s = map { ($_-1)/10 } sieve_prime_cluster(10,1e9, 2,6,8); say for @s; # _Dana Jacobsen_, May 04 2017
%Y A007811 Cf. A024912, A102338, A102342, A102700, A007530, A014561, A008471, A032352, A216292, A216293, A125855.
%Y A007811 Cf. A010051, A245304, A245305.
%K A007811 nonn
%O A007811 1,2
%A A007811 _N. J. A. Sloane_ and _J. H. Conway_, Mar 15 1996