A277547 - OEIS

A277547

a(n) = n/9^m mod 9, where 9^m is the greatest power of 9 that divides n.

1, 2, 3, 4, 5, 6, 7, 8, 1, 1, 2, 3, 4, 5, 6, 7, 8, 2, 1, 2, 3, 4, 5, 6, 7, 8, 3, 1, 2, 3, 4, 5, 6, 7, 8, 4, 1, 2, 3, 4, 5, 6, 7, 8, 5, 1, 2, 3, 4, 5, 6, 7, 8, 6, 1, 2, 3, 4, 5, 6, 7, 8, 7, 1, 2, 3, 4, 5, 6, 7, 8, 8, 1, 2, 3, 4, 5, 6, 7, 8, 1, 1, 2, 3, 4, 5

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

OFFSET

1,2

COMMENTS

a(n) is the rightmost nonzero digit in the base 9 expansion of n.

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

EXAMPLE

a(11) = (11/9 mod 9) = 2.

MATHEMATICA

Table[Mod[n/9^IntegerExponent[n, 9], 9], {n, 1, 160}]

PROG