Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116677
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116677 Numbers n such that prime(n) == 12 (mod n). +0
5
91, 4124467, 27067043, 27067229, 27067261, 27067523, 1208198857, 8179002137, 8179002191 (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] == 12, Print[n]], {n, 10^9}]

CROSSREFS

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

Cf. A116678.

Sequence in context: A116507 A083828 A119130 this_sequence A031200 A075479 A081222

Adjacent sequences: A116674 A116675 A116676 this_sequence A116678 A116679 A116680

KEYWORD

nonn

AUTHOR

Giovanni Resta (g.resta(AT)iit.cnr.it) and 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