Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023146
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023146 Numbers n such that prime(n) == 4 (mod n). +0
12
75, 77, 637331, 637333, 637341, 637343, 27067053, 179992917, 8179002205 (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] == 4, Print[n]], {n, 1, 10^9}] (from Robert G. Wilson v Feb 18 2004)

CROSSREFS

Cf. A092046, A023143, A023144, A023145, A023147, A023148, A023149, A023150, A023151, A023152.

Sequence in context: A063680 A033395 A143754 this_sequence A031945 A049355 A095585

Adjacent sequences: A023143 A023144 A023145 this_sequence A023147 A023148 A023149

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

2 more terms from Giovanni Resta (g.resta(AT)iit.cnr.it) and 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 6 19:58 EST 2009. Contains 170429 sequences.


AT&T Labs Research