|
Search: id:A131264
|
|
|
| A131264 |
|
Numbers n such that n divides Sum[ Prime[k]^10, {k,1,n} ]. |
|
+0
11
|
| |
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
s = 0; Do[s = s + Prime[n]^10; If[ Mod[s, n] == 0, Print[n]], {n, 1000000}]
|
|
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, A125827, A131272, A131273, A131274, A131275, A131276, A131277, A131278, A131279, A131280, A131281, A131282, A131283, A131284, A131285, A131289, A131290, A131291.
Sequence in context: A059330 A054803 A166807 this_sequence A053322 A025393 A025394
Adjacent sequences: A131261 A131262 A131263 this_sequence A131265 A131266 A131267
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Jun 25 2007
|
|
EXTENSIONS
|
a(4) & a(5) from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 28 2007
|
|
|
Search completed in 0.002 seconds
|
