|
Search: id:A125827
|
|
|
| A125827 |
|
Numbers n such that n divides Sum[ Prime[k]^11, {k,1,n} ]. |
|
+0
11
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
No other terms up to 10^8. -Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 06 2007
|
|
MATHEMATICA
|
s = 0; Do[s = s + Prime[n]^11; If[ Mod[s, n] == 0, Print[n]], {n, 7000}]
|
|
CROSSREFS
|
Cf. A085450, A122142, A122103, A098999, A007504, A045345, A024450, A111441, A122102, A122140.
Sequence in context: A080863 A091214 A036305 this_sequence A063317 A090820 A044127
Adjacent sequences: A125824 A125825 A125826 this_sequence A125828 A125829 A125830
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 03 2007
|
|
EXTENSIONS
|
3 more terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 06 2007
|
|
|
Search completed in 0.005 seconds
|
