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 A348158 #17 Nov 15 2021 10:32:10
%S A348158 1,1,3,3,5,3,7,7,9,5,11,7,13,7,15,15,17,9,19,15,21,11,23,15,25,13,27,
%T A348158 21,29,15,31,31,33,17,35,25,37,19,39,31,41,21,43,33,45,23,47,31,49,25,
%U A348158 51,39,53,27,55,49,57,29,59,31,61,31,57,63,65,33,67,51,69
%N A348158 a(n) is the sum of the distinct values obtained when the Euler totient function is applied to the divisors of n.
%C A348158 The sum of the distinct values of the n-th row of A102190.
%C A348158 Apparently, all the terms are odd.
%H A348158 Amiram Eldar, <a href="/A348158/b348158.txt">Table of n, a(n) for n = 1..10000</a>
%F A348158 a(n) <= n, with equality if and only if n is in A326835.
%e A348158 The divisors of 12 are {1, 2, 3, 4, 6, 12} and their phi values are {1, 1, 2, 2, 2, 4}. The set of distinct values is {1, 2, 4} whose sum is 7. Therefore, a(12) = 7.
%p A348158 with(numtheory):
%p A348158 a:= n-> add(i, i=map(phi, divisors(n))):
%p A348158 seq(a(n), n=1..69); # _Alois P. Heinz_, Nov 15 2021
%t A348158 a[n_] := Plus @@ DeleteDuplicates @ Map[EulerPhi, Divisors[n]]; Array[a, 100]
%o A348158 (PARI) a(n) = vecsum(Set(apply(eulerphi, divisors(n)))); \\ _Michel Marcus_, Oct 04 2021
%o A348158 (Python)
%o A348158 from sympy import totient, divisors
%o A348158 def A348158(n): return sum(set(map(totient,divisors(n,generator=True)))) # _Chai Wah Wu_, Nov 15 2021
%Y A348158 Cf. A000010, A102190, A319696, A326835.
%K A348158 nonn
%O A348158 1,3
%A A348158 _Amiram Eldar_, Oct 03 2021