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 A354364 #10 Jun 02 2022 14:48:26
%S A354364 1,1,1,1,1,2,1,1,1,4,1,1,1,4,2,1,1,1,1,1,6,2,1,2,1,2,1,1,1,8,1,1,2,4,
%T A354364 4,1,1,4,6,8,1,24,1,1,1,2,1,1,1,1,2,1,1,4,2,4,6,4,1,2,1,2,1,1,2,4,1,1,
%U A354364 6,16,1,1,1,2,3,1,2,12,1,1,1,4,1,6,4,4,2,2,1,4,6,1,2,2,8,2,1,1,1,1,1,8,1,2,24
%N A354364 a(n) = A003973(n) / A354363(n).
%H A354364 Antti Karttunen, <a href="/A354364/b354364.txt">Table of n, a(n) for n = 1..20000</a>
%H A354364 Antti Karttunen, <a href="/A354364/a354364.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%H A354364 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A354364 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A354364 a(n) = A353784(A003961(n)).
%o A354364 (PARI)
%o A354364 A003973(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); sigma(factorback(f)); };
%o A354364 A354364(n) = { my(f=factor(n)~); (A003973(n)/lcm(vector(#f, i, A003973(f[1, i]^f[2, i])))); };
%Y A354364 Cf. A003961, A003973, A353784, A354363.
%K A354364 nonn
%O A354364 1,6
%A A354364 _Antti Karttunen_, May 30 2022