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 A264784 #8 Dec 04 2015 19:14:44 %S A264784 1,2,5,10,1,21,2,42,1,1,5,1,85,2,2,10,2,170,1,1,1,5,1,1,5,1,21,1,1,5, %T A264784 1,341,2,2,2,10,2,2,10,2,42,2,2,10,2,682,1,1,1,1,5,1,1,1,5,1,1,5,1,21, %U A264784 1,1,1,5,1,1,5,1,21,1,1,5,1,85,1,1,1,5,1,1 %N A264784 Run lengths of zeros in A265158. %C A264784 Conjecture: A000975(n) = a(A155051(n-1)). %H A264784 Reinhard Zumkeller, <a href="/A264784/b264784.txt">Table of n, a(n) for n = 1..10000</a> %o A264784 (Haskell) %o A264784 import Data.List (group) %o A264784 a264784 n = a264784_list !! (n-1) %o A264784 a264784_list = map length $ filter ((== 0) . head) $ group a265158_list %Y A264784 Cf. A265158. %Y A264784 Record values and where they occur: A000975 and A155051, conjectured. %K A264784 nonn %O A264784 1,2 %A A264784 _Reinhard Zumkeller_, Dec 04 2015