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 A113451 #12 Mar 11 2017 21:16:49 %S A113451 1,4,6,8,12,14,19,22,24,25,27,29,31,38,44,48,50,59,63,65,70,72,75,77, %T A113451 78,79,85,87,88,90,92,93,94,95,112,117,122,124,126,128,131,132,134, %U A113451 135,136,143,147,149,151,153,155,156,158,159,163,166,169,181,183,186,192,196 %N A113451 Integers n such that prime(n+1) - prime(n) is a power. %H A113451 G. C. Greubel, <a href="/A113451/b113451.txt">Table of n, a(n) for n = 1..2500</a> %e A113451 87 is in the sequence since prime(88) - prime(87) = 457 - 449 = 8 = 2^3. %p A113451 egcd := proc(n) local L; L:=ifactors(n)[2]; L:=map(proc(z) z[2] end, L); igcd(op(L)) end; M:=[]: cnt:=0: for z to 1 do for k from 1 to 200 do p:=ithprime(k); q:=nextprime(p); x:=q-p; if egcd(x)>1 then cnt:=cnt+1; M:=[op(M), [cnt,k,x]] fi od od; M; map(proc(z) z[3] end, M); %t A113451 f[n_] := GCD @@ Last /@ FactorInteger[n] != 1; Select[Range[200], f[Prime[ # + 1] - Prime[ # ]] &] (* _Ray Chandler_, Oct 19 2006 *) %Y A113451 Cf. A000040, A001597, A113472. %K A113451 easy,nonn %O A113451 1,2 %A A113451 _Walter Kehowski_, Jan 08 2006 %E A113451 Edited by _Ray Chandler_, Oct 19 2006