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 A327154 #9 Sep 18 2019 16:14:08
%S A327154 1,1,1,1,1,12,1,1,1,2,1,6,1,5,2,1,1,2,1,2,1,3,1,48,1,2,1,80,1,45,1,1,
%T A327154 2,2,1,1,1,3,1,8,1,44,1,6,2,5,1,6,1,1,3,2,1,20,1,20,1,2,1,80,1,11,1,1,
%U A327154 1,63,1,2,2,7,1,2,1,2,1,6,1,20,1,2,1,2,1,264,1,3,2,6,1,48,2,10,1,7,2,108,1,1,2,1,1,125,1,2,2
%N A327154 a(n) = Product_{d|n, d>1} A008578(1+A286561(sigma(n),d)), where A286561(n,d) gives the highest exponent of d dividing n.
%H A327154 Antti Karttunen, <a href="/A327154/b327154.txt">Table of n, a(n) for n = 1..16384</a>
%H A327154 Antti Karttunen, <a href="/A327154/a327154.txt">Data supplement: n, a(n) computed for n = 1..65537</a>
%F A327154 a(n) = Product_{d|n, d>1} A008578(1+A286561(sigma(n),d)), where sigma = A000203.
%F A327154 Other identities. For all n >= 1:
%F A327154 1+A001222(a(n)) = A073802(n).
%o A327154 (PARI) A327154(n) = { my(m=1,s=sigma(n),v); fordiv(n,d,if((d>1) && ((v = valuation(s,d))>0), m *= prime(v))); (m); };
%Y A327154 Cf. A000040, A008578, A286561, A073802.
%Y A327154 Cf. also A293514, A322312, A323155, A327155, A327156.
%K A327154 nonn
%O A327154 1,6
%A A327154 _Antti Karttunen_, Sep 18 2019