Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116658
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116658 Numbers n such that prime(n) == 13 (mod n). +0
5
22, 40, 42, 84, 86, 90, 193, 2712, 16056, 16058, 40077, 40123, 40124, 40125, 251720, 251766, 251769, 251787, 637332, 10553432, 10553435, 10553501, 10553568, 10553817, 10553826, 27067042, 27067132, 69709722, 179993160, 465769803 (list; graph; listen)
OFFSET

1,1

COMMENT

Or, positions of 13 in A004648.

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 13, Print[n]], {n, 10^9}] (* Robert G. Wilson v *)

CROSSREFS

Cf. A004648; A023143 - A023152, A116657, A116677, A116658, A116659: prime(n) == m (mod n), m=1..14.

Sequence in context: A043976 A131196 A075217 this_sequence A026061 A138040 A063327

Adjacent sequences: A116655 A116656 A116657 this_sequence A116659 A116660 A116661

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), Feb 21 2006

EXTENSIONS

a(20)-a(30) 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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research