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 A109315 #10 May 06 2013 04:14:25
%S A109315 12,15,38,39,118,152,190,258,462,690,746,1396,1632,2119,3370,4522,
%T A109315 4600,7520,15006,24222,33156,34038,51372,52342,64638,77470,90790,
%U A109315 101946,104670,156772,166822,167700,175818,194092,200022,229630,246208,328462,362440,372882
%N A109315 Numbers n such that prime(n) - n is a prime power.
%H A109315 Donovan Johnson, <a href="/A109315/b109315.txt">Table of n, a(n) for n = 1..1000</a>
%F A109315 prime(n) - n = q^k, q is prime and k_Integer >= 2.
%e A109315 690 is OK because prime(690)-690 = 5179-690 = 4489 = 67^2, 67 is prime.
%t A109315 lst = {}; fQ[n_] := Block[{pf=FactorInteger[n]}, (2-Length[pf])(pf[[1, 2]]-1) > 0]; Do[ If[ fQ[Prime[n] - n], Print[n]; AppendTo[lst, n]], {n, 3, 362439}]; lst
%Y A109315 Cf. A025475 = powers of a prime but not prime, also nonprime n such that sigma(n)*phi(n)>(n-1)2; A107712 = values of q, A107713 = values of k; A107714 = values of prime(A109315(n)).
%Y A109315 Cf. A083240.
%K A109315 nonn
%O A109315 1,1
%A A109315 _Zak Seidov_ and _Robert G. Wilson v_, May 22 2005