This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277545 a(n) = n/7^m mod 7, where 7^m is the greatest power of 7 that divides n. 1
 1, 2, 3, 4, 5, 6, 1, 1, 2, 3, 4, 5, 6, 2, 1, 2, 3, 4, 5, 6, 3, 1, 2, 3, 4, 5, 6, 4, 1, 2, 3, 4, 5, 6, 5, 1, 2, 3, 4, 5, 6, 6, 1, 2, 3, 4, 5, 6, 1, 1, 2, 3, 4, 5, 6, 1, 1, 2, 3, 4, 5, 6, 2, 1, 2, 3, 4, 5, 6, 3, 1, 2, 3, 4, 5, 6, 4, 1, 2, 3, 4, 5, 6, 5, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) is the rightmost nonzero digit in the base 7 expansion of n. LINKS Clark Kimberling, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A242603(n) mod 7. - Michel Marcus, Oct 20 2016 EXAMPLE a(9) = (9/7 mod 7) = 2. MATHEMATICA Table[Mod[n/7^IntegerExponent[n, 7], 7], {n, 1, 160}] PROG (PARI) a(n) = n/7^valuation(n, 7) % 7; \\ Michel Marcus, Oct 20 2016 CROSSREFS Cf. A010876, A242603. Sequence in context: A256307 A030998 A255827 * A190596 A053842 A010885 Adjacent sequences:  A277542 A277543 A277544 * A277546 A277547 A277548 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.

Last modified October 18 23:39 EDT 2019. Contains 328211 sequences. (Running on oeis4.)