This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A252768 #14 Jan 23 2015 14:03:08
%S A252768 5,5,13,14593,372313,2315773,541613713
%N A252768 Primes p with property that the sum of the k-th powers of the successive gaps between primes <= p are prime numbers for k = 1 to n.
%C A252768 This is a subsequence of A006512 (greater of twin primes), see comment by _Robert G. Wilson v_ there. - _Michel Marcus_, Jan 23 2015
%H A252768 Abhiram R Devesh, <a href="/A252768/a252768.txt">Python code to generate this sequence</a>
%e A252768 n=3, p=13, List of primes [2, 3, 5, 7, 11, 13] and respective prime gaps are [1, 2, 2, 4, 2].
%e A252768 k=1: Sum of prime gaps = 11.
%e A252768 k=2: Sum of squares of prime gaps = 29.
%e A252768 k=3: Sum of cubes of prime gaps = 89.
%o A252768 (PARI) a(n) = {vp = primes(200000); vdp = vector(#vp-1, k, vp[k+1] - vp[k]); vpp = vector(n, k, 1); k = 2; while (sum(m=1, n, isprime(vpp[m])) != n, for (j=1, n, vpp[j] += vdp[k]^j;); k++;); vp[k];} \\ _Michel Marcus_, Jan 23 2015
%Y A252768 Cf. A006512, A247177, A247178, A251623, A252655.
%K A252768 nonn,hard,more
%O A252768 1,1
%A A252768 _Abhiram R Devesh_, Dec 21 2014