|
%I #17 Dec 08 2023 07:10:08
%S 1,2,3,4,5,6,7,8,9,1,1,2,3,4,5,6,7,8,9,2,1,2,3,4,5,6,7,8,9,3,1,2,3,4,
%T 5,6,7,8,9,4,1,2,3,4,5,6,7,8,9,5,1,2,3,4,5,6,7,8,9,6,1,2,3,4,5,6,7,8,
%U 9,7,1,2,3,4,5,6,7,8,9,8,1,2,3,4,5,6,7,8,9,9,1,2,3,4,5,6,7,8,9,1,1,2,3,4,5
%N Ultimate modulo 10: right-hand nonzero digit of n.
%H Harry J. Smith, <a href="/A065881/b065881.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Fi#final">Index entries for sequences related to final digits of numbers</a>
%F If n mod 10 = 0 then a(n) = a(n/10), otherwise a(n) = n mod 10.
%e a(3)=3, a(23)=3, a(30)=3, a(12300)=3.
%t um10[n_]:=Module[{idns=Split[IntegerDigits[n]]},If[idns[[-1,1]] == 0, idns[[-2,1]], idns[[-1,1]]]]; Array[um10,110] (* _Harvey P. Dale_, Dec 26 2016 *)
%o (PARI) { for (n=1, 1000, a=n; while (a%10 == 0, a\=10); write("b065881.txt", n, " ", a%10) ) } \\ _Harry J. Smith_, Nov 03 2009
%o (Python)
%o def A065881(n): return int(str(n).rstrip('0')[-1]) # _Chai Wah Wu_, Dec 07 2023
%Y In base 2 this is A000012, base 3 A060236 and base 4 A065882. For n <= 100 this sequence is also "Remove final zeros from n" which in bases 2, 3 and 4 produces A000265, A038502 and A065883. Cf. A010879.
%K base,nonn
%O 1,2
%A _Henry Bottomley_, Nov 26 2001
|
