A068235 a(n) is the smallest prime p such that p and the next n-1 primes are all == 11 (mod 12).

11, 467, 1499, 16763, 260339, 2003387, 7722419, 20221283, 927161471, 4284484931, 7355362139, 84805717127, 478527373859, 2046207697631, 7302359785151, 21104656617827, 21104656617827

Offset

1,1

Comments

Dickson's conjecture implies that a(n) exists for all n.

a(18) > 4*10^14. - Giovanni Resta, Aug 04 2013

Links

Table of n, a(n) for n=1..17.

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++ ]]

Prog

(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: A180087 A233219 A288685 * A247598 A303207 A266026

Adjacent sequences: A068232 A068233 A068234 * A068236 A068237 A068238

Keyword

more,nice,nonn

Author

Ferenc Adorjan (fadorjan(AT)freemail.hu), Feb 22 2002

Extensions

Edited by Dean Hickerson, Mar 06 2002

More terms from Giovanni Resta, Feb 18 2006

a(16)-a(17) from Giovanni Resta, Aug 04 2013

Status

approved