|
|
A232824
|
|
Prime(k), where k is such that (1 + Sum_{i=1..k} prime(i)^8) / k is an integer.
|
|
1
|
|
|
2, 3, 5, 7, 11, 13, 19, 23, 29, 37, 47, 53, 71, 89, 107, 113, 131, 157, 167, 173, 197, 223, 281, 311, 409, 463, 503, 541, 569, 659, 751, 941, 997, 1033, 1069, 1259, 1297, 1511, 1567, 2129, 2423, 3221, 3413, 3671, 3907, 4057, 4091, 4231, 5051, 5197, 5569
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(5) = 11, because 11 is the 5th prime and the sum of the first 5 primes^8+1 = 220521125 when divided by 5 equals 44104225 which is an integer.
|
|
MATHEMATICA
|
t = {}; sm = 1; 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
|
|
CROSSREFS
|
Cf. A085450 (smallest m > 1 such that m divides Sum_{k=1..m} prime(k)^n).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|