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 A327169 #9 Feb 01 2025 08:50:36
%S A327169 1,1,0,1,0,1,0,2,0,0,0,1,0,0,0,2,0,1,0,1,0,0,0,3,0,0,0,0,0,0,0,2,0,0,
%T A327169 0,2,0,0,0,2,0,0,0,1,0,0,0,3,0,0,0,0,0,0,0,1,0,0,0,2,0,0,0,3,0,0,0,0,
%U A327169 0,0,0,4,0,0,0,0,0,0,0,2,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,4,0,0,0,0,0,0,0,1,0
%N A327169 Number of distinct k such that A000005(k)*A000010(k) is equal to n.
%C A327169 a(n) tells how many times in total n occurs in A062355.
%H A327169 Antti Karttunen, <a href="/A327169/b327169.txt">Table of n, a(n) for n = 1..20000</a>
%H A327169 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%F A327169 a(n) = Sum_{k=1..n} [A000005(k)*A000010(k) == n], where [ ] is the Iverson bracket.
%o A327169 (PARI) A327169(n) = sum(k=1,n,(eulerphi(k)*numdiv(k))==n);
%o A327169 (PARI) f(d, m) = my(v = invphi(d)); sum(i = 1, #v, numdiv(v[i]) == m); \\ using _Max Alekseyev_'s invphi.gp
%o A327169 a(n) = sumdiv(n, d, f(d, n/d)); \\ _Amiram Eldar_, Feb 01 2025
%Y A327169 Cf. A000005, A000010, A062355.
%Y A327169 Cf. also A327153, A327166.
%K A327169 nonn
%O A327169 1,8
%A A327169 _Antti Karttunen_, Sep 19 2019