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 A330976 #5 Jan 08 2020 09:45:01
%S A330976 6,8,10,13,14,17,18,20,23,24,25,27,28,32,33,34,35,37,39,40,41,43,44,
%T A330976 46,48,49,50,51,53,54,55,58,59,60,61,62,63,65,68,69,70,71,72,73,75,76,
%U A330976 78,79,80,81,82,83,84,85,86,87,88,89,90,91,93,94,95,96,99
%N A330976 Numbers that are not the number of factorizations into factors > 1 of any positive integer.
%C A330976 Warning: I have only confirmed the first eight terms. The rest are derived from A045782. - _Gus Wiseman_, Jan 07 2020
%H A330976 R. E. Canfield, P. Erdős and C. Pomerance, <a href="http://math.dartmouth.edu/~carlp/PDF/paper39.pdf">On a Problem of Oppenheim concerning "Factorisatio Numerorum"</a>, J. Number Theory 17 (1983), 1-28.
%t A330976 nn=15;
%t A330976 fam[n_]:=fam[n]=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[fam[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A330976 nds=Length/@Array[fam[#]&,2^nn];
%t A330976 Complement[Range[nn],nds]
%Y A330976 Complement of A045782.
%Y A330976 The strict version is A330975.
%Y A330976 Factorizations are A001055, with image A045782.
%Y A330976 Strict factorizations are A045778, with image A045779.
%Y A330976 The least number with n factorizations is A330973(n).
%Y A330976 Cf. A033833, A045779, A045783, A317145, A330935, A330972, A330974, A330977, A330991.
%K A330976 nonn
%O A330976 1,1
%A A330976 _Gus Wiseman_, Jan 07 2020