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 A332040 #9 Feb 06 2020 00:48:01
%S A332040 1,1,1,0,1,2,1,0,0,2,1,1,1,1,1,0,1,1,1,0,1,2,1,1,0,1,0,0,1,5,1,0,1,2,
%T A332040 1,0,1,1,1,0,1,2,1,0,0,1,1,0,0,1,1,0,1,0,1,1,1,1,1,3,1,1,0,0,1,3,1,0,
%U A332040 1,2,1,1,1,1,0,0,1,3,1,0,0,1,1,1,1,1,1
%N A332040 Number of integers whose exponential divisors sum to n.
%H A332040 Amiram Eldar, <a href="/A332040/b332040.txt">Table of n, a(n) for n = 1..10000</a>
%e A332040 a(6) = 2 since there are 2 solutions to esigma(x) = 6 (esigma is A051377): 4 and 6.
%t A332040 f[p_, e_] := DivisorSum[e, p^# &]; esigma[1] = 1; esigma[n_] := Times @@ f @@@ FactorInteger[n]; m = 100; v = Table[0, {m}]; Do[e = esigma[k]; If[e <= m, v[[e]]++], {k, 1, m}]; v
%Y A332040 Cf. A054973, A051377, A063974, A332036, A332038.
%K A332040 nonn
%O A332040 1,6
%A A332040 _Amiram Eldar_, Feb 05 2020