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 A373703 #19 Jun 20 2024 22:50:25
%S A373703 1,1,1,1,1,1,1,1,1,1,1,6,1,1,1,1,1,6,1,10,1,1,1,36,1,1,1,14,1,1,1,1,1,
%T A373703 1,1,1,1,1,1,100,1,1,1,22,15,1,1,216,1,10,1,26,1,36,1,196,1,1,1,30,1,
%U A373703 1,21,1,1,1,1,34,1,1,1,6,1,1,15,38,1,1,1,1000
%N A373703 a(n) = A062760(n)*A066636(n).
%C A373703 If n has unequal prime exponents (a term in A059404), then a(n) > 1; otherwise a(n) = 1.
%H A373703 Michael De Vlieger, <a href="/A373703/b373703.txt">Table of n, a(n) for n = 1..10000</a>
%F A373703 For n > 1, a(n) = A007947(n)^k where k is the difference between the greatest and least exponents in the prime power factorization of n.
%e A373703 a(12) = A062760(12)*A066636(12) = 2*3 = 6.
%e A373703 a(45) = A062760(45)*A066636(45) = 3*5 = 15.
%t A373703 Table[Function[{r, s}, r^(Max[s] - Min[s])] @@ {Times @@ #[[All, 1]], #[[All, -1]]} &@ FactorInteger[n], {n, 120}] (* _Michael De Vlieger_, Jun 13 2024 *)
%o A373703 (PARI) a(n) = if (n==1, 1, my(f=factor(n)); (factorback(f[, 1]))^(vecmax(f[,2])-vecmin(f[,2]))); \\ _Michel Marcus_, Jun 14 2024
%Y A373703 Cf. A007947, A059404, A062760, A066636.
%K A373703 nonn
%O A373703 1,12
%A A373703 _David James Sycamore_, Jun 13 2024