|
| |
|
|
A131272
|
|
Numbers n such that n divides Sum[ Prime[k]^12, {k,1,n} ].
|
|
10
| | |
|
|
|
OFFSET
| 1,2
|
|
|
MATHEMATICA
| s = 0; Do[s = s + Prime[n]^12; If[ Mod[s, n] == 0, Print[n]], {n, 1000000}]
|
|
|
PROG
| (PARI) s=0; n=0; forprime(p=2, 1e9, s+=p^12; if(s%n++==0, print1(n", "))) \\ Charles R Greathouse IV, Apr 14, 2011
|
|
|
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, A131273, A131274, A131275, A131276, A131277, A131278, A131279, A131280, A131281, A131282, A131283, A131284, A131285, A131289, A131290, A131291.
Sequence in context: A195215 A183481 A202801 * A083117 A129055 A193158
Adjacent sequences: A131269 A131270 A131271 * A131273 A131274 A131275
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Jun 25 2007, Jun 28 2007
|
|
|
EXTENSIONS
| a(4)-a(6) from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 30 2007
a(7)-a(8) from Charles R Greathouse IV, Apr 14, 2011
|
| |
|
|
