login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190793 Least prime p(j) of 10 consecutive primes such that 2*p(k)+ 15015 is prime for k=j to j+9. 1

%I

%S 11161,11171,11173,11177,11197,161561,474937,474941,474949,4005917,

%T 4005943,5984101,12352877,14821097,18416329,18416351,18416371,

%U 19622833,28334069,33426761,61714043,103887869,212299561,228433487,245416663,246522383,317706671

%N Least prime p(j) of 10 consecutive primes such that 2*p(k)+ 15015 is prime for k=j to j+9.

%C 15015 is the product of the first 5 odd primes.

%H Pierre CAMI, <a href="/A190793/b190793.txt">Table of n, a(n) for n = 1..46</a>

%e 11161 is the first p(j) of 14 consecutive primes such that 2*p(k)+15015 is prime for k=j to j+9.

%t okQ[n_] := Module[{k = 0}, While[k < 10 && PrimeQ[2*Prime[n + k] + 15015], k++]; k == 10]; Prime[Select[Range[100000], okQ]] (* _T. D. Noe_, May 24 2011 *)

%K nonn

%O 1,1

%A _Pierre CAMI_, May 20 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 09:05 EDT 2020. Contains 336438 sequences. (Running on oeis4.)