A190321 Number of nonzero digits when writing n in base where place values are squares, cf. A007961.

0, 1, 1, 1, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 3, 3, 1, 2, 2, 2, 2, 3, 3, 3, 2, 1, 2, 2, 2, 2, 3, 3, 3, 2, 2, 3, 1, 2, 2, 2, 2, 3, 3, 3, 2, 2, 3, 3, 3, 1, 2, 2, 2, 2, 3, 3, 3, 2, 2, 3, 3, 3, 3, 4, 1, 2, 2, 2, 2, 3, 3, 3, 2, 2, 3, 3, 3, 3, 4, 4, 2, 1, 2, 2, 2, 2

Offset

0,6

Comments

For n > 0: a(A000290(n)) = 1; for n > 1: a(A002522(n)) = 2;

a(n) <= A000196(n).

Links

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000

Prog

(Haskell)
a190321 n = g n $ reverse $ takeWhile (<= n) $ tail a000290_list where
  g _ []                 = 0
  g m (x:xs) | x > m     = g m xs
             | otherwise = signum m' + g r xs where (m', r) = divMod m x

Crossrefs

Cf. A190311, A053610.

Sequence in context: A143477 A214774 A320107 * A338409 A238890 A266968

Adjacent sequences: A190318 A190319 A190320 * A190322 A190323 A190324

Keyword

nonn,base

Author

Reinhard Zumkeller, May 08 2011

Status

approved