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 A362802 #9 May 05 2023 01:41:30
%S A362802 0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,4,0,0,0,1,0,3,0,0,0,0,
%T A362802 0,0,0,0,0,1,0,1,0,0,1,0,0,15,0,0,0,0,0,3,0,1,0,0,0,175,0,0,0,0,0,2,0,
%U A362802 0,0,0,0,78,0,0,0,0,0,1,0,0,0,0,0,188,0
%N A362802 a(n) is the number of ways in which the set of divisors of n can be partitioned into disjoint parts, all of length > 1 and with integer harmonic mean.
%F A362802 a(A362801(n)) > 0.
%e A362802 n a(n) partitions
%e A362802 == ==== ==========
%e A362802 6 1 {{1, 2, 3, 6}}
%e A362802 12 1 {{1, 2, 3, 6}, {4, 12}}
%e A362802 24 4 {{1, 2, 3, 6}, {4, 8, 12, 24}}, {{1, 2, 4, 8, 12, 24}, {3, 6}},
%e A362802 {{1, 3, 6}, {2, 4, 8, 12, 24}}, {{1, 2, 3, 6}, {4, 12}, {8, 24}}
%t A362802 harmQ[s_] := AllTrue[s, Length[#] > 1 && IntegerQ[HarmonicMean[#]] &]; a[n_] := Module[{d = Divisors[n], r}, r = ResourceFunction["SetPartitions"][d]; Count[r, _?harmQ]]; Array[a, 119]
%Y A362802 Cf. A339453, A339665, A362801, A362803 (indices of records).
%K A362802 nonn
%O A362802 1,24
%A A362802 _Amiram Eldar_, May 04 2023