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 A357860 #6 Oct 23 2022 23:55:40
%S A357860 1,1,0,1,0,1,0,2,0,1,0,2,0,1,0,2,0,1,0,2,0,1,0,3,0,1,0,2,0,1,0,3,0,1,
%T A357860 0,2,0,1,0,3,0,1,0,2,0,1,0,5,0,1,0,2,0,1,0,3,0,1,0,3,0,1,0,4,0,1,0,2,
%U A357860 0,1,0,4,0,1,0,2,0,1,0,5,0,1,0,3,0,1,0
%N A357860 Number of integer factorizations of n into distinct even factors.
%e A357860 The factorizations of 36..48 are (empty columns indicated by dots):
%e A357860 36 . 38 . 40 . 42 . 44 . 46 . 48
%e A357860 2*18 2*20 2*22 6*8
%e A357860 4*10 2*24
%e A357860 4*12
%e A357860 2*4*6
%t A357860 facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
%t A357860 Table[Length[Select[facs[n],UnsameQ@@#&&OddQ[Times@@(#+1)]&]],{n,100}]
%Y A357860 The non-strict version is A349906.
%Y A357860 Same as A357859 with zeros every other term.
%Y A357860 A000005 counts divisors.
%Y A357860 A001055 counts factorizations.
%Y A357860 A001221 counts distinct prime factors, sum A001414.
%Y A357860 A001222 counts prime-power divisors.
%Y A357860 A050361 counts strict factorizations into prime powers.
%Y A357860 Cf. A000009, A000688, A000961, A023894, A295935, A318721, A340785.
%K A357860 nonn
%O A357860 1,8
%A A357860 _Gus Wiseman_, Oct 17 2022