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 A161503 #14 Mar 11 2020 23:02:13
%S A161503 2,6,6,16,14,6,46,20,52,104,54,28,44,80,72,92,172,20,142,34,110,134,
%T A161503 130,98,106,78,174,306,26,132,54,258,116,78,50,90,448,66,214,302,140,
%U A161503 352,466,246,670,594,396,20,244,228,640,546,462,354,1040,408,176,564,760
%N A161503 a(n) = NextPrime(n^n) - PrevPrime(n^n).
%H A161503 Hugo Pfoertner, <a href="/A161503/b161503.txt">Table of n, a(n) for n = 2..1000</a>
%F A161503 a(n) = A074966(n) + A074967(n) = A013633(A000312(n)). - _R. J. Mathar_, Jun 12 2009
%e A161503 3 <- 2^2 -> 5; 5 - 3 = 2;
%e A161503 23 <- 3^3 -> 29; 29 - 23 = 6.
%p A161503 for n from 2 to 100 do nn := n^n ; printf("%d,",nextprime(nn)-prevprime(nn) ) ; od: # _R. J. Mathar_, Jun 12 2009
%t A161503 PrimeNext[n_]:=Module[{k},k=n+1;While[ !PrimeQ[k],k++ ];k]; PrimePrev[n_]:=Module[{k}, k=n-1;While[ !PrimeQ[k],k-- ];k]; DeltaY[n_]:=PrimeNext[n]-PrimePrev[n]; lst={};Do[AppendTo[lst,DeltaY[n^n]],{n,2,5!}];lst
%t A161503 npnn[n_]:=Module[{nn=n^n},NextPrime[nn]-NextPrime[nn,-1]]; Array[npnn,60,2] (* _Harvey P. Dale_, Dec 07 2013 *)
%Y A161503 Cf. A074966, A074967.
%Y A161503 Cf. A000312, A013633.
%K A161503 nonn
%O A161503 2,1
%A A161503 _Vladimir Joseph Stephan Orlovsky_, Jun 11 2009
%E A161503 Offset changed by _R. J. Mathar_, Jun 12 2009