|
|
A190478
|
|
a(n) is the smallest prime prime(k) > a(n-1) such that the n numbers 2*prime(j)+3, j=k to k+n-1, are all prime.
|
|
2
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
This essentially searches for blocks of n consecutive primes of the form A023204 (see also A089530) with a minimum of the primes in the block set by the previous entry in the sequence. - R. J. Mathar, Jun 02 2011
|
|
LINKS
|
|
|
EXAMPLE
|
For n=1, 2 is prime and 2*2+3=7 is prime so a(1)=2.
For n=2, 5,7 are consecutive primes 2*5+3 and 2*7+3 are primes so a(2)=5 as 5 is the least such prime > 2.
For n=3, 13,17,19 are consecutive primes 2*13+3, 2*17+3, 2*19+3 are primes so a(3)=13 as 13 is the least such prime > 5.
|
|
MAPLE
|
isA023204 := proc(n) isprime(n) and isprime(2*n+3) ; end proc:
A190478idx := proc(n) option remember; if n = 1 then 1; else for a from procname(n-1)+1 do krun := true; for k from a to a+n-1 do if not isA023204(ithprime(k)) then krun := false; break; end if; end do: if krun then return a; end if; end do: end if; end proc:
|
|
PROG
|
(PARI) old(p, k)=while(k--, p=precprime(p-1)); p;
n=1; k=0; forprime(p=2, 4e9, if(isprime(p<<1+3), if(k++==n, print1(old(p, n)", "); k--; n++), k=0)) \\ Charles R Greathouse IV, May 11 2011
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more,hard,changed
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|