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