|
|
A068233
|
|
a(n) is the smallest prime p such that p and the next n-1 primes are all == 7 (mod 12).
|
|
8
|
|
|
7, 199, 199, 32443, 180799, 180799, 4338787, 84885631, 472798219, 1786054267, 6024282871, 64791932287, 592175010019, 6265824724519, 7816088451907, 24660781037467
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Dickson's conjecture implies that a(n) exists for all n.
|
|
LINKS
|
|
|
MATHEMATICA
|
For[i=n=1, True, Null, For[j=0, j<n&&Mod[Prime[i+j], 12]==7, j++, Null]; If[j==n, Print[Prime[i]]; n++, i++ ]]
|
|
PROG
|
(PARI) {i=n=1; while(1, j=0; while(j<n&&prime(i+j)%12==7, j++); if(j==n, print(prime(i)); n++, i++))}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nice,nonn
|
|
AUTHOR
|
Ferenc Adorjan (fadorjan(AT)freemail.hu), Feb 22 2002
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|