Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116657
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116657 Numbers n such that prime(n) == 11 (mod n). +0
5
20, 38, 39, 82, 190, 192, 444, 2702, 40079, 40156, 251719, 251725, 251733, 251740, 251788, 637322, 637342, 10553424, 10553571, 10553575, 10553646, 10553824, 27066990, 69709708, 69709870, 69709881, 69709941, 179992918, 179993010 (list; graph; listen)
OFFSET

1,1

COMMENT

Or, positions of 11 in A004648.

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 11, 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: A048066 A135801 A078210 this_sequence A132606 A054288 A040380

Adjacent sequences: A116654 A116655 A116656 this_sequence A116658 A116659 A116660

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

a(11)-a(29) 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