|
|
A232822
|
|
Prime(m), where m is such that (Sum_{k=1..m} prime(k)^8) / m is an integer.
|
|
2
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The primes correspond to indices m = 1, 43, 824747, 3171671, ... = A125828. - M. F. Hasler, Dec 01 2013
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(2) = 191, because 191 is the 43rd prime and the sum of the first 43 primes^8 = 7287989395992721002 = 43 * 169488125488202814.
|
|
MATHEMATICA
|
t = {}; sm = 0; Do[sm = sm + Prime[n]^8; If[Mod[sm, n] == 0, AppendTo[t, Prime[n]]], {n, 100000}]; t (* Derived from A217599 *)
|
|
PROG
|
(PARI) is(n)=if(!isprime(n), return(0)); my(t=primepi(n), s); forprime(p=2, n, s+=Mod(p, t)^8); s==0 \\ Charles R Greathouse IV, Nov 30 2013
(PARI) S=n=0; forprime(p=1, , (S+=p^8)%n++||print1(p", ")) \\ M. F. Hasler, Dec 01 2013
|
|
CROSSREFS
|
Cf. A085450 (smallest m > 1 that divides Sum_{k=1..m} prime(k)^n).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|