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 A175609 #5 Nov 21 2013 12:50:02
%S A175609 0,0,0,0,1,1,2,1,2,2,0,1,1,1,3,1,2,3,3,2,1,3,1,1,3,1,1,1,1,2,0,4,2,2,
%T A175609 1,2,2,2,2,1,1,1,5,4,2,1,1,4,1,2,2,3,3,4,6,4,3,3,2,2,2,1,1,2,2,3,1,2,
%U A175609 1,2,3,2,3,2,3,6,3,2,2,1,2,1,3,2,2,2,4,2,2,2,2,4,2,3,3,4,6,4,4,3,2,2,2,2,2
%N A175609 The difference between maximal run length and minimal run length in binary representation of n-th prime.
%F A175609 a(n)=A175599(A000040(n)).
%t A175609 rl[n_]:=Module[{spl=Length/@Split[IntegerDigits[Prime[n],2]]}, Max[spl]- Min[spl]]; rl/@Range[110] (* _Harvey P. Dale_, Jul 27 2011 *)
%K A175609 nonn
%O A175609 1,7
%A A175609 _Juri-Stepan Gerasimov_, Jul 23 2010