This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A367466 #12 Jun 23 2024 02:20:48
%S A367466 1,3,4,7,6,12,8,15,13,8,2,18,4,14,14,21,8,29,10,12,12,6,4,30,11,12,20,
%T A367466 26,10,22,2,23,8,14,18,41,8,20,16,20,2,26,4,14,28,12,8,44,17,13,12,18,
%U A367466 4,40,12,40,20,20,10,28,2,6,24,27,14,24,8,26,16,24,2,55,4
%N A367466 Sum of the final digits of the divisors of n.
%C A367466 First differs from A093811 at a(21) = 12.
%C A367466 Inverse Möbius transform of (n mod 10) (A010879). - _Wesley Ivan Hurt_, Jun 23 2024
%F A367466 a(n) = Sum_{d|n} (d mod 10).
%e A367466 a(21) = 12; The divisors of 21 are {1, 3, 7, 21} and the sum of the final digits of the divisors is 1 + 3 + 7 + 1 = 12.
%p A367466 f:= proc(n) add(t mod 10, t = numtheory:-divisors(n)) end proc:
%p A367466 map(f, [$1..100]); # _Robert Israel_, Nov 19 2023
%t A367466 Table[DivisorSum[n, Mod[#, 10] &], {n, 100}]
%o A367466 (PARI) a(n) = sumdiv(n, d, d%10); \\ _Michel Marcus_, Nov 19 2023
%Y A367466 Cf. A010879, A093811.
%K A367466 nonn,base,easy
%O A367466 1,2
%A A367466 _Wesley Ivan Hurt_, Nov 18 2023