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 A353783 #15 May 09 2022 11:02:36
%S A353783 1,3,4,7,6,12,8,15,13,6,12,28,14,24,12,31,18,39,20,42,8,12,24,60,31,
%T A353783 42,40,56,30,12,32,63,12,18,24,91,38,60,28,30,42,24,44,84,78,24,48,
%U A353783 124,57,93,36,14,54,120,12,120,20,30,60,84,62,96,104,127,42,12,68,126,24,24,72,195,74,114,124,140,24,84,80
%N A353783 a(n) = LCM_{p^e||n} sigma(p^e), where n = Product_{p^e||n}, with each p^e the maximal power of prime p that divides n.
%H A353783 Michael De Vlieger, <a href="/A353783/b353783.txt">Table of n, a(n) for n = 1..10000</a>
%H A353783 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A353783 a(n) = A000203(n) / A353784(n).
%F A353783 a(n) = A353785(n) * A080398(n).
%F A353783 For all n >= 1, A087207(a(n)) = A351560(n).
%t A353783 Array[LCM @@ DivisorSigma[1, Power @@@ FactorInteger[#]] &, 79] (* _Michael De Vlieger_, May 08 2022 *)
%o A353783 (PARI) A353783(n) = { my(f=factor(n)~); lcm(vector(#f, i, sigma(f[1, i]^f[2, i]))); };
%Y A353783 Cf. A000203, A080398, A087207, A351560, A353784, A353785.
%Y A353783 Cf. also A345044, A345046.
%Y A353783 Cf. A336547 (positions where equal to sigma).
%K A353783 nonn
%O A353783 1,2
%A A353783 _Antti Karttunen_, May 08 2022