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 A130796 #11 Nov 21 2013 12:49:05
%S A130796 23,31,47,53,61,73,83,113,131,139,151,157,167,173,181,199,211,233,241,
%T A130796 251,257,263,271,283,293,317,331,337,353,367,373,383,409,421,433,443,
%U A130796 467,503,509,523,541,547,557,563,571,577,587,593,601,607,619,631,647
%N A130796 Primes p such that nextprime(p)-p is not power of 2.
%C A130796 Indices of primes are 9,11,15,16,18,21,23,30,32,34,36,37,39,40,42,46,47,51, 53,54,55,56,58,61,62,66,... (subsequence of A113339).
%t A130796 <<NumberTheory`NumberTheoryFunctions`; c=0;p=2; Do[p1=NextPrime[p];If[ !IntegerQ[Log[2, p1-p]],c++;a[c]=p];p=p1,{200}];Table[a[i],{i,c}]
%t A130796 Select[Prime[Range[200]],!IntegerQ[Log[2,NextPrime[#]-#]]&] (* _Harvey P. Dale_, Apr 20 2011 *)
%Y A130796 Cf. A001223 Differences between consecutive primes, A082509 Differences between consecutive primes that are not powers of 2, A082508 Differences between consecutive primes that are powers of 2, A113339 Integers n such that prime(n+1)-prime(n) is nonprime, squarefree.
%K A130796 nonn
%O A130796 1,1
%A A130796 _Zak Seidov_, Aug 20 2007