|
Search: id:A131279
|
|
|
| A131279 |
|
Numbers n such that n divides Sum[ Prime[k]^19, {k,1,n} ]. |
|
+0
11
|
|
| 1, 25, 453, 677, 839, 1015, 3735, 4175, 4413, 10369, 14239, 43311, 452567, 1274185, 14102849, 37801813, 71271705, 93524231
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
MATHEMATICA
|
s = 0; Do[s = s + Prime[n]^19; If[ Mod[s, n] == 0, Print[n]], {n, 50000}]
|
|
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, A131276, A131277, A131278, A131280, A131281, A131282, A131283, A131284, A131285, A131289, A131290, A131291.
Adjacent sequences: A131276 A131277 A131278 this_sequence A131280 A131281 A131282
Sequence in context: A001714 A016633 A001811 this_sequence A056069 A089386 A014927
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Jun 25 2007
|
|
EXTENSIONS
|
More terms from Ryan Propper (rpropper(AT)cs.stanford.edu), Oct 09 2007
|
|
|
Search completed in 0.002 seconds
|
