The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A277546 a(n) = n/8^m mod 8, where 8^m is the greatest power of 8 that divides n. 1
1, 2, 3, 4, 5, 6, 7, 1, 1, 2, 3, 4, 5, 6, 7, 2, 1, 2, 3, 4, 5, 6, 7, 3, 1, 2, 3, 4, 5, 6, 7, 4, 1, 2, 3, 4, 5, 6, 7, 5, 1, 2, 3, 4, 5, 6, 7, 6, 1, 2, 3, 4, 5, 6, 7, 7, 1, 2, 3, 4, 5, 6, 7, 1, 1, 2, 3, 4, 5, 6, 7, 1, 1, 2, 3, 4, 5, 6, 7, 2, 1, 2, 3, 4, 5, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n) is the rightmost nonzero digit in the base 8 expansion of n.
LINKS
EXAMPLE
a(11) = (11/8 mod 8) = 3.
MATHEMATICA
Table[Mod[n/8^IntegerExponent[n, 8], 8], {n, 1, 160}]
m8[n_]:=Module[{idn=IntegerDigits[n, 8]}, While[idn[[-1]]==0, idn = Most[ idn]]; idn[[-1]]]; Array[m8, 90] (* Harvey P. Dale, Apr 02 2017 *)
PROG
(PARI) a(n) = n/8^valuation(n, 8) % 8; \\ Michel Marcus, Oct 20 2016
CROSSREFS
Cf. A010877.
Sequence in context: A054634 A346731 A255828 * A190597 A338881 A053843
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 20 16:51 EDT 2024. Contains 372719 sequences. (Running on oeis4.)