OFFSET
1,1
LINKS
Abhiram R Devesh, Table of n, a(n) for n = 1..1000
EXAMPLE
a(1)=5; primes less than or equal to 5: [2, 3, 5]; 4th power of prime gaps: [1, 16]; sum of 4th power of prime gaps: 17.
a(2)=19; primes less than or equal to 13: [2, 3, 5, 7, 11, 13, 17, 19]; 4th powers of prime gaps (see A140299): [1, 16, 16, 256, 16, 256, 16]; sum of these: 577.
MATHEMATICA
p = 2; q = 3; s = 0; lst = {}; While[p < 2500, s = s + (q - p)^4; If[ PrimeQ@ s, AppendTo[lst, q]]; p = q; q = NextPrime@ q]; lst (* Robert G. Wilson v, Dec 19 2014 *)
PROG
(Python)
import sympy
p=2
s=0
while 10000>p>0:
np=sympy.nextprime(p)
if sympy.isprime(s):
print(p)
d=np-p
s+=(d**4)
p=np
(PARI) p = 2; q = 3; s = 1; for (i = 1, 100, p = q; q = nextprime (q + 1); if (isprime (s = s + (q - p)^4), print1 (q ", "))) \\ Zak Seidov, Jan 19 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Abhiram R Devesh, Dec 06 2014
STATUS
approved