|
|
A233042
|
|
Prime(k), where k is such that (1 + Sum_{j=1..k} prime(j)^9) / k is an integer.
|
|
1
|
|
|
2, 3, 7, 13, 29, 37, 43, 421, 487, 3373, 5399, 6637, 7333, 117703, 124679, 130829, 218681, 243263, 374537, 2326021, 9423619, 183040409, 224628653, 255740687, 419532599, 707933033, 932059759, 2088543701, 19690779263, 27538667491, 32425948213, 51958163189, 128193738073, 1064987253349
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
a(4) = 13, because 13 is the 6th prime and the sum of the first 6 primes^9+1 = 13004773992 when divided by 6 equals 2167462332 which is an integer.
|
|
MAPLE
|
|
|
MATHEMATICA
|
t = {}; sm = 1; Do[sm = sm + Prime[n]^9; 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)^9); 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
|
|
|
|