The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 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: A291085 A193556 A120438 * A038800 A126712 A162232 Adjacent sequences: A192974 A192975 A192976 * A192978 A192979 A192980 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Aug 04 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 13:38 EST 2022. Contains 358700 sequences. (Running on oeis4.)