Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023150
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023150 Numbers n such that prime(n) == 8 (mod n). +0
14
17, 443, 2701, 100365, 637235, 637325, 4124455, 4124473, 4124587, 27067125, 27067137, 27067521, 8179002131, 8179002135, 8179002153, 55762149069 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 8, Print[n]], {n, 1, 10^9}] (from Robert G. Wilson v Feb 18 2004)

CROSSREFS

Cf. A092050, A023143, A023144, A023145, A023146, A023147, A023148, A023149, A023151, A023152.

Sequence in context: A167474 A158063 A035022 this_sequence A012117 A122430 A009051

Adjacent sequences: A023147 A023148 A023149 this_sequence A023151 A023152 A023153

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 18 2004

a(13)-a(16) from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 22 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 December 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research