Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068234
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068234 a(n) is the smallest prime p such that p and the next n-1 primes are all == 5 (mod 12). +0
9
5, 509, 4397, 42509, 647417, 647417, 1248869, 13175609, 234946997, 1039154933, 7114719473, 32021552837, 32021552837, 1237381737257, 2904797643617, 2904797643617, 2904797643617 (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]==5, 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==5, j++); if(j==n, print(prime(i)); n++, i++))}

CROSSREFS

Cf. A068227, A068228, A068229, A040117, A068231, A068232, A068233, A068235.

Sequence in context: A114066 A083151 A128682 this_sequence A012741 A003394 A110721

Adjacent sequences: A068231 A068232 A068233 this_sequence A068235 A068236 A068237

KEYWORD

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research