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 A072074 #37 Nov 24 2024 11:28:19
%S A072074 2,2,4,11,16,24,43,63,94,152,224,324,464,644,897,1271,1790,2521,3501,
%T A072074 4814,6535,8779,11739,15585,20625,27166,35588,46363,60065,77424,99337,
%U A072074 127020,161930,205847,260929,329782,415533,522173,654548,818278,1020391
%N A072074 Number of integers k such that phi(k) = 10^n.
%C A072074 a(n) is the coefficient of x^n*y^n in Product_p Sum_{u, v} x^u*y^v, where the product is taken over all primes p and the sum is taken over such u, v that 2^u*5^v = phi(p^k) for some nonnegative integer k. - _Max Alekseyev_, Apr 26 2010
%C A072074 Elaborating on above comment, primes p must be in A077497 and k must be 1 for primes other than 2 and 5. - _Ray Chandler_, Feb 12 2012
%H A072074 Ray Chandler, <a href="/A072074/b072074.txt">Table of n, a(n) for n = 0..1000</a>
%H A072074 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%H A072074 Max A. Alekseyev, <a href="https://www.emis.de/journals/JIS/VOL19/Alekseyev/alek5.html">Computing the Inverses, their Power Sums, and Extrema for Euler's Totient and Other Multiplicative Functions</a>. Journal of Integer Sequences, Vol. 19 (2016), Article 16.5.2.
%F A072074 a(n) = Card{x : A000010(x)=10^n}.
%e A072074 n=3: a(3)=11 because InvPhi(1000) = {1111, 1255, 1375, 1875, 2008, 2222, 2500, 2510, 2750, 3012, 3750}.
%p A072074 [seq(nops(invphi(10^i)),i=1..8)];
%o A072074 (PARI) a(n) = #invphi(10^n); \\ for invphi see Alekseyev link \\ _Michel Marcus_, May 14 2020
%Y A072074 Cf. A000010, A014197, A014573, A110078, A072075, A072076.
%K A072074 nonn
%O A072074 0,1
%A A072074 _Labos Elemer_, Jun 13 2002
%E A072074 More terms from _Max Alekseyev_, Apr 26 2010