A245305 -id:A245305 - cp's OEIS frontend

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

1, 10, 19, 82, 148, 187, 208, 325, 346, 565, 943, 1300, 1564, 1573, 1606, 1804, 1891, 1942, 2101, 2227, 2530, 3172, 3484, 4378, 5134, 5533, 6298, 6721, 6949, 7222, 7726, 7969, 8104, 8272, 8881, 9784, 9913, 10111, 10984, 11653, 11929, 12220, 13546, 14416, 15727

Offset: 1

N. J. A. Sloane and J. H. Conway, Mar 15 1996

nonn

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A024912, A102338, A102342, A102700, A007530, A014561, A008471, A032352, A216292, A216293, A125855.

Cf. A010051, A245304, A245305.

a007811 n = a007811_list !! (n-1)
a007811_list = map (pred . head) $ filter (all (== 1) . map a010051') $
   iterate (zipWith (+) [10, 10, 10, 10]) [1, 3, 7, 9]
-- Reinhard Zumkeller, Jul 18 2014

[n: n in [0..10000] | forall{10*n+r: r in [1,3,7,9] | IsPrime(10*n+r)}]; // Bruno Berselli, Sep 04 2012

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

Select[ Range[ 1, 10000, 3 ], PrimeQ[ 10*#+1 ] && PrimeQ[ 10*#+3 ] && PrimeQ[ 10*#+7 ] && PrimeQ[ 10*#+9 ]& ]
Select[Range[15000], And @@ PrimeQ /@ ({1, 3, 7, 9} + 10#) &] (* Ray Chandler, Jan 12 2007 *)

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

use ntheory ":all"; my @s = map { ($-1)/10 } sieve_prime_cluster(10,1e9, 2,6,8); say for @s; # _Dana Jacobsen, May 04 2017

a(n) = 3*A014561(n) + 1. - Zak Seidov, Sep 21 2009

A245304 Numbers m such that m+1, m+3, m+7, m+9 and m+13 are all primes.

Original entry on oeis.org

4, 10, 100, 1480, 16060, 19420, 21010, 22270, 43780, 55330, 144160, 165700, 166840, 195730, 201820, 225340, 247600, 268810, 326140, 347980, 361210, 397750, 465160, 518800, 536440, 633460, 633790, 661090, 768190, 795790, 829720, 857950, 876010, 958540

Offset: 1

Reinhard Zumkeller, Jul 18 2014

nonn

W. Sierpiński, 250 Problems in Elementary Number Theory. New York: American Elsevier, 1970. Problem #82, variant.

Reinhard Zumkeller and Jens Kruse Andersen, Table of n, a(n) for n = 1..1000 (first 120 terms from Zumkeller)

Cf. A010051, A022006, A245305, A007811, subsequence of A125855.

a245304 n = a245304_list !! (n-1)
a245304_list = map (pred . head) $ filter (all (== 1) . map a010051') $
   iterate (zipWith (+) [1, 1, 1, 1, 1]) [1, 3, 7, 9, 13]

[n: n in [0..10^6] | IsPrime(n+1) and IsPrime(n+3) and IsPrime(n+7) and IsPrime(n+9) and IsPrime(n+13)]; // Vincenzo Librandi, Jun 15 2015

Select[Range[10^6],AllTrue[#+{1,3,7,9,13},PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, May 07 2015 *)

forprime(p=2, 10^7, m=p-1; if(isprime(m+3)&&isprime(m+7)&&isprime(m+9)&&isprime(m+13), print1(m", "))) \\ Jens Kruse Andersen, Jul 18 2014

a(n) = A022006(n)-1. - Jens Kruse Andersen, Jul 18 2014

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Perl

Formula