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 A192977 #18 Jul 13 2013 12:04:13 %S A192977 4,4,2,2,3,2,2,3,2,1,0,4,1,1,3,1,2,2,2,1,4,0,0,1,3,2,1,2,2,2,2,1,0,1, %T A192977 3,0,2,2,2,1,2,2,1,0,2,1,1,3,2,1,3,1,1,2,0,2,0,2,0,2,1,2,2,1,2,0,2,3, %U A192977 0,1,3,2,1,2,1,1,0,2,1,1,2,1,2,2,1,1 %N A192977 Number of times 9*n occurs in A068395. %H A192977 Reinhard Zumkeller, <a href="/A192977/b192977.txt">Table of n, a(n) for n = 0..10000</a> %e A192977 n=1: A068395(k) = 9 = 9*1, for k = 5,6,7,8 therefore a(1) = 4; %e A192977 n=10: 90 = 9*10 doesn't occur in A068395, therefore a(10) = 0; %e A192977 n=100: A068395(156) = A068395(157) = 900 = 9*100, therefore a(100) = 2. %o A192977 (Haskell) %o A192977 import Data.List (group) %o A192977 a192977_list = f 0 $ group a068395_list where %o A192977 f n xss'@(xs:xss) %o A192977 | head xs `div` 9 == n = length xs : f (n+1) xss %o A192977 | otherwise = 0 : f (n+1) xss' %K A192977 nonn,base %O A192977 0,1 %A A192977 _Reinhard Zumkeller_, Aug 04 2011