A190311 - OEIS

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

A190311

Number of nonzero digits when writing n in base where place values are positive cubes, cf. A000433.

3

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, 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, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3

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

OFFSET

0,10

COMMENTS

For n > 0: a(A000578(n)) = 1; for n > 1: a(A001093(n)) = 2;

a(n) <= A048766(n).

LINKS

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

PROG

(Haskell)

a190311 n = g n $ reverse $ takeWhile (<= n) $ tail a000578_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. A190321, A055640.

Sequence in context: A037815 A347622 A297034 * A117005 A263204 A194322

Adjacent sequences: A190308 A190309 A190310 * A190312 A190313 A190314

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, May 08 2011

STATUS

approved