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 A301829 #5 Apr 16 2018 18:52:19
%S A301829 0,1,1,3,1,4,1,7,3,4,1,12,1,4,4,15,1,12,1,12,4,4,1,29,3,4,7,12,1,17,1,
%T A301829 29,4,4,4,37,1,4,4,29,1,17,1,12,12,4,1,64,3,12,4,12,1,29,4,29,4,4,1,
%U A301829 53,1,4,12,54,4,17,1,12,4,17,1,92,1,4,12,12,4,17
%N A301829 Number of ways to choose a nonempty submultiset of a factorization of n into factors greater than one.
%F A301829 a(n) = Sum_{d|n, d>1} f(d) * f(n/d) where f(n) = A001055(n) is the number of factorizations of n into factors greater than 1.
%e A301829 The a(12) = 12 submultisets ("<" means subset or equal):
%e A301829 (2)<(2*2*3), (3)<(2*2*3), (2*2)<(2*2*3), (2*3)<(2*2*3), (2*2*3)<(2*2*3),
%e A301829 (2)<(2*6), (6)<(2*6), (2*6)<(2*6),
%e A301829 (3)<(3*4), (4)<(3*4), (3*4)<(3*4),
%e A301829 (12)<(12).
%t A301829 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A301829 Table[Sum[Length[facs[d]]*Length[facs[n/d]],{d,Rest[Divisors[n]]}],{n,100}]
%Y A301829 Cf. A000712, A001055, A001222, A001405, A122768, A276024, A281113, A284640, A295632, A299701, A299702, A299729, A301830.
%K A301829 nonn
%O A301829 1,4
%A A301829 _Gus Wiseman_, Mar 27 2018