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