|
|
A233462
|
|
Prime(n), where n is such that (1+Sum_{i=1..n} prime(i)^16) / n is an integer.
|
|
1
|
|
|
2, 3, 5, 7, 11, 13, 19, 23, 29, 37, 47, 53, 59, 71, 89, 103, 113, 131, 139, 167, 173, 197, 223, 233, 257, 269, 281, 311, 337, 409, 439, 463, 503, 541, 557, 659, 719, 769, 941, 997, 1013, 1069, 1109, 1163, 1249, 1259, 1321, 1451, 1493, 1511, 1613, 1747, 1867
(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^16+1 = 45983115425144645 when divided by 5 equals 9196623085028929 which is an integer.
|
|
MATHEMATICA
|
t = {}; sm = 1; Do[sm = sm + Prime[n]^16; 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)^16); 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
|
|
|
|