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 A073807 #16 Jul 13 2023 01:17:47
%S A073807 1,3,6,2,12,18,8,12,2,20,18,12,8,24,36,4,32,6,24,24,24,30,36,72,4,24,
%T A073807 32,16,24,60,36,16,60,48,60,4,16,72,24,80,24,72,24,36,24,60,60,24,8,
%U A073807 12,96,16,20,96,80,96,50,40,72,72,16,108,16,8,54,100,12,64,108,100,32,24
%N A073807 Number of divisors of sum of cube of divisors.
%C A073807 a(n) = 2 for n in A063783. - _Robert Israel_, Jul 12 2023
%H A073807 Robert Israel, <a href="/A073807/b073807.txt">Table of n, a(n) for n = 1..10000</a>
%F A073807 a(n) = A000005(A001158(n)).
%e A073807 For n=10: D={1,2,5,10}, 1+8+125+1000=1134, divisors(1134)={1,2,3,6,7,9,14,18,21,27,42,54,63,81,126,162,189,378,567,1134} so a(10)=20.
%p A073807 f:= n -> numtheory:-tau(numtheory:-sigma[3](n)):
%p A073807 map(f, [$1..100]); # _Robert Israel_, Jul 12 2023
%t A073807 Table[DivisorSigma[0,DivisorSigma[3,n]],{n,80}] (* _Harvey P. Dale_, Dec 13 2011 *)
%o A073807 (PARI) a(n) = numdiv(sigma(n, 3)); \\ _Michel Marcus_, Jul 13 2023
%Y A073807 Cf. A000005, A001158, A062068, A063783, A073802-A073813.
%K A073807 nonn
%O A073807 1,2
%A A073807 _Labos Elemer_, Aug 13 2002