|
Search: id:A131276
|
|
|
| A131276 |
|
Numbers n such that n divides Sum[ Prime[k]^16, {k,1,n} ]. |
|
+0
11
|
| |
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
s = 0; Do[s = s + Prime[n]^16; If[ Mod[s, n] == 0, Print[n]], {n, 500000}]
|
|
CROSSREFS
|
Cf. A085450 = smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n. Cf. A045345, A111441, A122140, A125907, A122142, A125825, A125826, A125828, A131263, A131264, A125827, A131272, A131273, A131274, A131275, A131277, A131278, A131279, A131280, A131281, A131282, A131283, A131284, A131285, A131289, A131290, A131291.
Sequence in context: A017585 A132655 A045172 this_sequence A045075 A071143 A061048
Adjacent sequences: A131273 A131274 A131275 this_sequence A131277 A131278 A131279
|
|
KEYWORD
|
more,nonn,less
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Jun 25 2007
|
|
|
Search completed in 0.002 seconds
|
