|
| |
|
|
A023146
|
|
Numbers n such that prime(n) == 4 (mod n).
|
|
11
| | |
|
|
|
OFFSET
| 1,1
|
|
|
MATHEMATICA
| NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 4, Print[n]], {n, 1, 10^9}] (from Robert G. Wilson v Feb 18 2004)
|
|
|
CROSSREFS
| Cf. A092046, A023143, A023144, A023145, A023147, A023148, A023149, A023150, A023151, A023152.
Sequence in context: A063680 A033395 A143754 * A031945 A049355 A095585
Adjacent sequences: A023143 A023144 A023145 * A023147 A023148 A023149
|
|
|
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
2 more terms from Giovanni Resta (g.resta(AT)iit.cnr.it) and Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 22 2006
|
| |
|
|
