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 A224782 #22 Apr 30 2013 13:00:12 %S A224782 0,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,0,1,0,0,1,1,1,1,0,0,1,0,0,1,1,0,0,0, %T A224782 0,0,0,0,1,0,1,1,1,1,1,1,1,1,1,0,1,0,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,0, %U A224782 1,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,1,1 %N A224782 Length of longest run of consecutive zeros in decimal representation of 2^n. %C A224782 a(n) <= A027870(n); %C A224782 a(A007377(n)) = 0; %C A224782 a(A006889(n)) = n and a(m) <> n for m < A006889(n). %D A224782 Julian Havil, Impossible?: Surprising Solutions to Counterintuitive Conundrums, Princeton University Press 2008, chapter 15, p. 176ff %H A224782 Reinhard Zumkeller, <a href="/A224782/b224782.txt">Table of n, a(n) for n = 0..10000</a> %o A224782 (Haskell) %o A224782 import Data.List (group) %o A224782 a224782 n = a224782_list !! n %o A224782 a224782_list = map (foldl h 0 . group . show) a000079_list where %o A224782 h x zs@(z:_) = if z == '0' then max x $ length zs else x %K A224782 nonn,base %O A224782 0,54 %A A224782 _Reinhard Zumkeller_, Apr 30 2013