|
%I #9 Jul 13 2013 12:04:08
%S 0,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,1,2,2,2,2,2,2,
%T 2,2,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,2,3,3,1,2,2,2,2,2,2,2,2,3,1,2,2,2,
%U 2,2,2,2,2,3,3,3,3,3,3,3,2,3,3,3,3,3
%N Number of nonzero digits when writing n in base where place values are positive cubes, cf. A000433.
%C For n > 0: a(A000578(n)) = 1; for n > 1: a(A001093(n)) = 2;
%C a(n) <= A048766(n).
%H Reinhard Zumkeller, <a href="/A190311/b190311.txt">Table of n, a(n) for n = 0..10000</a>
%o (Haskell)
%o a190311 n = g n $ reverse $ takeWhile (<= n) $ tail a000578_list where
%o g _ [] = 0
%o g m (x:xs) | x > m = g m xs
%o | otherwise = signum m' + g r xs where (m',r) = divMod m x
%Y Cf. A190321, A055640.
%K nonn,base
%O 0,10
%A _Reinhard Zumkeller_, May 08 2011
|
