|
%I #14 Apr 02 2017 12:08:15
%S 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,
%T 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,
%U 5,6,7,1,1,2,3,4,5,6,7,2,1,2,3,4,5,6
%N a(n) = n/8^m mod 8, where 8^m is the greatest power of 8 that divides n.
%C a(n) is the rightmost nonzero digit in the base 8 expansion of n.
%H Clark Kimberling, <a href="/A277546/b277546.txt">Table of n, a(n) for n = 1..10000</a>
%e a(11) = (11/8 mod 8) = 3.
%t Table[Mod[n/8^IntegerExponent[n, 8], 8], {n, 1, 160}]
%t 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 *)
%o (PARI) a(n) = n/8^valuation(n, 8) % 8; \\ _Michel Marcus_, Oct 20 2016
%Y Cf. A010877.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, Oct 19 2016
|
