A190321 - OEIS

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

A190321

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

4

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

(list; graph; refs; listen; history; text; internal format)

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: A378303 A214774 A320107 * A338409 A238890 A266968

Adjacent sequences: A190318 A190319 A190320 * A190322 A190323 A190324

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, May 08 2011

STATUS

approved