login
A192977
Number of times 9*n occurs in A068395.
2
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, 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, 0, 1, 3, 2, 1, 2, 1, 1, 0, 2, 1, 1, 2, 1, 2, 2, 1, 1
OFFSET
0,1
LINKS
EXAMPLE
n=1: A068395(k) = 9 = 9*1, for k = 5,6,7,8 therefore a(1) = 4;
n=10: 90 = 9*10 doesn't occur in A068395, therefore a(10) = 0;
n=100: A068395(156) = A068395(157) = 900 = 9*100, therefore a(100) = 2.
PROG
(Haskell)
import Data.List (group)
a192977_list = f 0 $ group a068395_list where
f n xss'@(xs:xss)
| head xs `div` 9 == n = length xs : f (n+1) xss
| otherwise = 0 : f (n+1) xss'
CROSSREFS
Sequence in context: A193556 A120438 A366470 * A038800 A126712 A162232
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Aug 04 2011
STATUS
approved