|
Search: id:A023147
|
|
|
| A023147 |
|
Numbers n such that prime(n) == 5 (mod n). |
|
+0
11
|
|
| 1, 2, 3, 9, 16, 33, 40073, 40078, 40082, 40083, 40122, 251721, 251722, 251734, 251736, 4124584, 10553433, 10553439, 10553444, 10553454, 10553478, 10553552, 10553553, 10553818, 27067098, 27067524, 179992912, 465769814, 465769832, 465769839
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 5, Print[n]], {n, 1, 10^9}] (from Robert G. Wilson v Feb 18 2004)
|
|
CROSSREFS
|
Cf. A092047, A023143, A023144, A023145, A023146, A023148, A023149, A023150, A023151, A023152.
Sequence in context: A124881 A054416 A092638 this_sequence A095742 A011951 A086771
Adjacent sequences: A023144 A023145 A023146 this_sequence A023148 A023149 A023150
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net)
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 18 2004
a(24)-a(27) from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 18 2004
Three missing initial terms at start of sequence inserted by Zak Seidov, Feb 05 2009
|
|
|
Search completed in 0.002 seconds
|
