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 A160491 #9 Jun 25 2021 23:14:40
%S A160491 7,235,16141,48811741,13011865891,232617453293191,143882557561868665,
%T A160491 8862794004464425240057,99999991137061880347498904071,
%U A160491 191843424957750480504146841291811
%N A160491 First differences of A062481.
%C A160491 a(1), a(3) and a(6) are the only primes found for n up to 10000 using The C/Gmp program in the link which is 17 times faster than the PARI routine. We read large blocks of primes into memory and test in memory.
%C A160491 If another prime exists, it is larger than 418977 digits.
%C A160491 A concept of order can be introduced here by researching and analyzing the next-nextprime, next-next-nextprime etc.
%H A160491 C.L. Hilliard,<a href="http://groups.google.com/group/prime-index-powers/web/c-gmp-prime-indices-to-prime-power">Primes less than 3 trillion</a>
%F A160491 a(n) = A062481(n+1) - A062481(n).
%e A160491 For n = 3, 4^7 - 3^3 = 16141, the 3rd entry in the sequence.
%o A160491 (PARI) ppower(n) = { for(x=1,n, y=(x+1)^prime(x+1)-x^prime(x); print1(y",") ); }
%K A160491 nonn
%O A160491 1,1
%A A160491 _Cino Hilliard_, May 15 2009
%E A160491 Edited by _R. J. Mathar_, May 17 2009