login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277547 a(n) = n/9^m mod 9, where 9^m is the greatest power of 9 that divides n. 1
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

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

CROSSREFS

Cf. A010878.

Sequence in context: A321999 A228822 A255829 * A190598 A053844 A010887

Adjacent sequences:  A277544 A277545 A277546 * A277548 A277549 A277550

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Oct 19 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 20 21:29 EST 2019. Contains 320350 sequences. (Running on oeis4.)