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 A066103 #20 Jul 04 2024 03:36:00
%S A066103 2,3,4,16,12,60,96,294,720,1936,3920,9680,33712,83248,303408,1517040,
%T A066103 5207472,26972352,74469808,255166128
%N A066103 Smallest m such that A001221(A001159(m)) = n.
%C A066103 a(18) > 18000000. - _Vaclav Kotesovec_, Sep 06 2019
%F A066103 a(n) = Min(x : A001221(A001159(x)) = n) = Min(x; A066102(x) = n).
%t A066103 Do[m = 1; While[PrimeNu[DivisorSigma[4, m]] != n, m++]; Print[m], {n, 1, 16}] (* _Vaclav Kotesovec_, Sep 05 2019 *)
%o A066103 (PARI) { for (n=1, 100, m=1; while (omega(sigma(m, 4)) != n, m++); write("b066103.txt", n, " ", m) ) } \\ _Harry J. Smith_, Nov 14 2009
%Y A066103 Cf. A001159, A001221, A066102.
%K A066103 nonn,more
%O A066103 1,1
%A A066103 _Labos Elemer_, Dec 04 2001
%E A066103 a(13) from _Harry J. Smith_, Nov 14 2009
%E A066103 a(14)-a(17) from _Vaclav Kotesovec_, Sep 06 2019
%E A066103 a(18)-a(20) from _Amiram Eldar_, Jul 04 2024