Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092046
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092046 Numbers n such that prime(n) == -4 (mod n). +0
11
1, 3, 5, 7, 9, 67, 441, 2615, 637237, 637329, 4124703, 27067119, 179993017, 1208198617, 8179002101, 55762149071, 55762149091 (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 - 4, Print[n]], {n, 1, 10^9}]

CROSSREFS

Cf. A023146, A045924, A092044, A092045, A092047, A092048, A092049, A092050, A092051, A092052.

Sequence in context: A081434 A007632 A117996 this_sequence A085951 A132286 A070788

Adjacent sequences: A092043 A092044 A092045 this_sequence A092047 A092048 A092049

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(17) 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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research