|
Search: id:A131273
|
|
|
| A131273 |
|
Numbers n such that n divides Sum[ Prime[k]^13, {k,1,n} ]. |
|
+0
11
|
| |
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
s = 0; Do[s = s + Prime[n]^13; If[ Mod[s, n] == 0, Print[n]], {n, 200000}]
|
|
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, A131274, A131275, A131276, A131277, A131278, A131279, A131280, A131281, A131282, A131283, A131284, A131285, A131289, A131290, A131291.
Sequence in context: A022588 A125435 A086943 this_sequence A023021 A022651 A077504
Adjacent sequences: A131270 A131271 A131272 this_sequence A131274 A131275 A131276
|
|
KEYWORD
|
more,nonn,less
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Jun 25 2007
|
|
EXTENSIONS
|
a(6) - a(8) from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 30 2007
|
|
|
Search completed in 0.002 seconds
|
