|
| |
|
|
A128171
|
|
Numbers n such that n divides 1 + Sum[ Prime[k]^7, {k,1,n} ].
|
|
6
| |
|
|
1, 2, 4, 5, 6, 10, 12, 46, 1830, 2086, 6000, 7681, 8242, 15204, 43698, 52054, 154490, 211052, 392767, 4309540, 6452151, 8773101, 15166410, 26552623, 176656106, 180281161
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
MATHEMATICA
| s = 1; Do[s = s + Prime[n]^7; If[ Mod[s, n] == 0, Print[n]], {n, 1000000}]
|
|
|
CROSSREFS
| Cf. A000041, A125826, A128165, A128166, A128167, A128168, A128169, A128170.
Sequence in context: A162534 A177911 A127092 * A171165 A039036 A043045
Adjacent sequences: A128168 A128169 A128170 * A128172 A128173 A128174
|
|
|
KEYWORD
| hard,more,nonn
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 22 2007, Feb 23 2007
|
|
|
EXTENSIONS
| More terms from Sean A. Irvine (sairvin(AT)xtra.co.nz), Jan 18 2011
|
| |
|
|