Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092044
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092044 Numbers n such that prime(n) == -2 (mod n). +0
14
1, 11, 71, 637319, 637323, 637327, 179993015, 1208198861, 8179002163, 8179002189, 55762149067, 55762149103 (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 - 2, Print[n]], {n, 1, 10^9}]

PROGRAM

(PARI) for(i=1, 10^9, if(Mod(prime(i), i)==-2, print1(i, ", ")));

CROSSREFS

Cf. A023144, A045924, A092045, A092046, A092047, A092048, A092049, A092050, A092051, A092052.

Cf. A105290.

Sequence in context: A139185 A103998 A034196 this_sequence A156149 A006975 A084900

Adjacent sequences: A092041 A092042 A092043 this_sequence A092045 A092046 A092047

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(7)-a(12) 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research