Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023152
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023152 Numbers n such that prime(n) == 10 (mod n). +0
18
19, 21, 2703, 15929, 4124583, 27067051, 179992913, 179993011, 179993159, 1208198559, 1208198859, 55762149031 (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] == 10, Print[n]], {n, 1, 10^9}] (from Robert G. Wilson v Feb 18 2004)

CROSSREFS

Cf. A092052, A023143, A023144, A023145, A023146, A023147, A023148, A023149, A023150, A023151.

Sequence in context: A158232 A050714 A113868 this_sequence A056025 A099954 A050955

Adjacent sequences: A023149 A023150 A023151 this_sequence A023153 A023154 A023155

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

Extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 18 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research