login
This site is supported by donations 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

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

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: A031035 A054634 A255828 * A190597 A053843 A010886

Adjacent sequences:  A277543 A277544 A277545 * A277547 A277548 A277549

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 15 04:00 EST 2018. Contains 317225 sequences. (Running on oeis4.)