|
Search: id:A068235
|
|
|
| A068235 |
|
a(n) is the smallest prime p such that p and the next n-1 primes are all == 11 (mod 12). |
|
+0
9
|
|
| 11, 467, 1499, 16763, 260339, 2003387, 7722419, 20221283, 927161471, 4284484931, 7355362139, 84805717127, 478527373859, 2046207697631, 7302359785151
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Dickson's conjecture implies that a(n) exists for all n.
|
|
LINKS
|
The Prime Glossary, Dickson's conjecture
|
|
MATHEMATICA
|
For[i=n=1, True, Null, For[j=0, j<n&&Mod[Prime[i+j], 12]==11, j++, Null]; If[j==n, Print[Prime[i]]; n++, i++ ]]
|
|
PROGRAM
|
(PARI) {i=n=1; while(1, j=0; while(j<n&&prime(i+j)%12==11, j++); if(j==n, print(prime(i)); n++, i++))}
|
|
CROSSREFS
|
Cf. A068227, A068228, A068229, A040117, A068231, A068232, A068233, A068234.
Sequence in context: A090558 A068135 A140840 this_sequence A041931 A101922 A142809
Adjacent sequences: A068232 A068233 A068234 this_sequence A068236 A068237 A068238
|
|
KEYWORD
|
hard,more,nice,nonn
|
|
AUTHOR
|
Ferenc Adorjan (fadorjan(AT)freemail.hu), Feb 22 2002
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Mar 06 2002
More terms from Giovanni Resta (g.resta(AT)iit.cnr.it), Feb 18 2006
|
|
|
Search completed in 0.002 seconds
|
