Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092045
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092045 Numbers n such that prime(n) == -3 (mod n). +0
11
1, 2, 25, 26, 68, 1054, 1058, 6472, 251723, 4124468, 69709727, 69709942, 465769817, 465769835, 1208198860, 8179002154, 8179002176, 8179002178, 145935689360, 145935689369, 145935689392, 145935689393 (list; graph; listen)
OFFSET

1,2

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == n - 3, Print[n]], {n, 1, 10^9}]

CROSSREFS

Cf. A023145, A045924, A092044, A092046, A092047, A092048, A092049, A092050, A092051, A092052.

Sequence in context: A076449 A153811 A101962 this_sequence A054283 A041723 A067443

Adjacent sequences: A092042 A092043 A092044 this_sequence A092046 A092047 A092048

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004

a(13)-a(22) 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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research