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