Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116659
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116659 Numbers n such that prime(n) == 14 (mod n). +0
5
23, 81, 85, 87, 16057, 4124457, 27067011, 27067127, 1208198605, 1208198851 (list; graph; listen)
OFFSET

1,1

COMMENT

Or, positions of 14 in A004648. - Robert G. Wilson v (rgwv(at)rgwv.com), Feb 22 2006

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 14, 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: A141974 A142650 A078597 this_sequence A139940 A052073 A128825

Adjacent sequences: A116656 A116657 A116658 this_sequence A116660 A116661 A116662

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

a(6)-a(10) 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research