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 A110174 #9 Feb 20 2023 12:26:24
%S A110174 0,0,2,1,0,0,0,1,2,2,0,1,0,4,4,1,0,2,0,5,4,4,0,3,4,4,4,7,0,0,0,1,6,2,
%T A110174 2,3,0,6,2,7,0,2,0,9,6,4,0,3,0,4,6,9,0,4,2,9,4,2,0,1,0,4,4,1,4,4,0,9,
%U A110174 4,4,0,5,0,4,8,9,2,6,0,7,0,2,0,3,4,4,8,9,0,2,0,11,8,4,0,3,0,2,6,9,0,6,0
%N A110174 Number of solutions 0<k<n to the equation phi(n) = phi(k) + phi(n-k), where phi is Euler's totient function.
%H A110174 Antti Karttunen, <a href="/A110174/b110174.txt">Table of n, a(n) for n = 1..65537</a>
%t A110174 a[n_] := Select[Range[n-1], EulerPhi[n]==EulerPhi[n-# ]+EulerPhi[ # ]&]; Table[Length[a[n]], {n, 150}]
%o A110174 (PARI) A110174(n) = { my(ph=eulerphi(n)); sum(k=1,n-1,(ph == (eulerphi(k)+eulerphi(n-k)))); }; \\ _Antti Karttunen_, Feb 20 2023
%Y A110174 Cf. A110173 (least k such that phi(n) = phi(k) + phi(n-k)).
%Y A110174 Cf. also A110177.
%K A110174 nonn,look
%O A110174 1,3
%A A110174 _T. D. Noe_, Jul 15 2005