A227945 Smallest possible number of nonzero digits in a positive multiple of n.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 1, 2, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1

Offset

1,11

Comments

a((10^n-1)/9) = n, so the sequence is not bounded.

Links

Max Alekseyev, Table of n, a(n) for n = 1..3000

Crossrefs

Cf. A077196

Sequence in context: A244227 A214713 A049046 * A003647 A353352 A084217

Adjacent sequences: A227942 A227943 A227944 * A227946 A227947 A227948

Keyword

nonn,base

Author

Max Alekseyev, Oct 04 2013

Status

approved