Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092052
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092052 Numbers n such that prime(n) == -10 (mod n). +0
11
1, 3, 437, 2639, 4124589, 27067013, 27067101, 27067139, 27067271 (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 - 10, Print[n]], {n, 1, 10^9}]

CROSSREFS

Cf. A023152, A045924, A092044, A092045, A092046, A092047, A092048, A092049, A092050, A092051.

Sequence in context: A152517 A087771 A086207 this_sequence A139999 A157601 A094454

Adjacent sequences: A092049 A092050 A092051 this_sequence A092053 A092054 A092055

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

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