|
Search: id:A023143
|
|
|
| A023143 |
|
Numbers n such that prime(n) == 1 (mod n). |
|
+0
21
|
|
| 1, 2, 5, 6, 12, 14, 181, 6459, 6460, 6466, 100362, 251712, 251732, 637236, 10553504, 10553505, 10553547, 10553827, 10553851, 10553852, 69709709, 69709724, 69709728, 69709869, 69709961, 69709962, 179992920, 179992922, 179993170
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
6 is in the sequence because the 6th prime, 13, is congruent to 1 mod 6.
|
|
MATHEMATICA
|
Do[ If[ IntegerQ[ (Prime[ n ] - 1) / n ], Print[ n ] ], {n, 1, 10^8} ]
|
|
CROSSREFS
|
Cf. A048891, A045924, A052013, A023144, A023145, A023146, A023147, A023148, A023149, A023150, A023151, A023152.
Sequence in context: A069789 A086334 A057518 this_sequence A085206 A058601 A108365
Adjacent sequences: A023140 A023141 A023142 this_sequence A023144 A023145 A023146
|
|
KEYWORD
|
nice,nonn,easy
|
|
AUTHOR
|
David W. Wilson (davidwwilson(AT)comcast.net), G. L. Honaker, Jr. (honak3r(AT)bvunet.net)
|
|
EXTENSIONS
|
More terms from Jud McCranie (j.mccranie(AT)comcast.net)
|
|
|
Search completed in 0.002 seconds
|
