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 A296132 #7 Dec 19 2017 02:40:33
%S A296132 1,1,1,2,1,2,1,3,2,2,1,3,1,2,2,4,1,3,1,3,2,2,1,5,2,2,3,3,1,5,1,4,2,2,
%T A296132 2,9,1,2,2,5,1,5,1,3,3,2,1,7,2,3,2,3,1,5,2,5,2,2,1,9,1,2,3,10,2,5,1,3,
%U A296132 2,5,1,9,1,2,3,3,2,5,1,7,4,2,1,9,2,2,2
%N A296132 Number of twice-factorizations of n where the first factorization is constant and the latter factorizations are strict, i.e., type (P,R,Q).
%C A296132 a(n) is also the number of ways to choose a perfect divisor d|n and then a sequence of log_d(n) strict factorizations of d.
%e A296132 The a(36) = 9 twice-factorizations are (2*3)*(2*3), (2*3)*(6), (6)*(2*3), (6)*(6), (2*3*6), (2*18), (3*12), (4*9), (36).
%t A296132 sfs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[sfs[n/d],Min@@#>d&]],{d,Rest[Divisors[n]]}]];
%t A296132 Table[Sum[Length[sfs[n^(1/g)]]^g,{g,Divisors[GCD@@FactorInteger[n][[All,2]]]}],{n,100}]
%Y A296132 Cf. A000005, A001055, A005117, A045778, A052409, A052410, A089723, A279788, A281113, A284639, A295920, A295931.
%K A296132 nonn
%O A296132 1,4
%A A296132 _Gus Wiseman_, Dec 05 2017