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 A325990 #5 May 31 2019 05:34:38
%S A325990 8,24,27,32,40,54,56,72,88,96,104,108,120,125,128,135,136,152,160,168,
%T A325990 184,189,200,216,224,232,243,248,250,256,264,270,280,288,296,297,312,
%U A325990 328,343,344,351,352,360,375,376,378,384,392,408,416,424,432,440,456
%N A325990 Numbers with more than one perfect factorization.
%C A325990 First differs from A060476 in lacking 1 and having 432.
%C A325990 A perfect factorization of n is an orderless factorization of n into factors > 1 such that every divisor of n is the product of exactly one submultiset of the factors. This is the intersection of covering (or complete) factorizations (A325988) and knapsack factorizations (A292886).
%t A325990 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A325990 Select[Range[100],Function[n,Length[Select[facs[n],Sort[Times@@@Union[Subsets[#]]]==Divisors[n]&]]>1]]
%Y A325990 Positions of terms > 1 in A325989.
%Y A325990 Cf. A002033, A292886, A325780, A325781, A325782, A325787, A325789, A325988.
%K A325990 nonn
%O A325990 1,1
%A A325990 _Gus Wiseman_, May 30 2019