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

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

(PARI) a(n) = n/9^valuation(n, 9) % 9; \\ Michel Marcus, Oct 20 2016

Crossrefs

Cf. A010878.

Sequence in context: A321999 A228822 A255829 * A190598 A338882 A053844

Adjacent sequences: A277544 A277545 A277546 * A277548 A277549 A277550

Keyword

nonn,easy

Author

Clark Kimberling, Oct 19 2016

Status

approved