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 A326852 #10 Feb 11 2021 01:49:18
%S A326852 0,0,0,0,0,0,1,0,1,0,1,0,16,0,1,7,11,0,30,0,40,18,1,0,201,0,1,38,124,
%T A326852 0,426,0,211,73,1,48,1391,0,1,131,1741,0,1774,0,951,2145,1,0,8345,0,
%U A326852 1853,381,2382,0,6718,2761,10633,623,1,0,68037
%N A326852 Number of non-constant integer partitions of n whose length and maximum both divide n.
%C A326852 The Heinz numbers of these partitions are given by A326838.
%H A326852 Fausto A. C. Cariboni, <a href="/A326852/b326852.txt">Table of n, a(n) for n = 0..180</a>
%e A326852 The a(6) = 1 through a(16) = 11 partitions (empty columns not shown):
%e A326852 (321) (4211) (52111) (633) (7211111) (53322) (8332)
%e A326852 (642) (53331) (8422)
%e A326852 (651) (54222) (8431)
%e A326852 (4332) (54321) (8521)
%e A326852 (4422) (54411) (8611)
%e A326852 (4431) (55221) (42222211)
%e A326852 (6222) (55311) (43222111)
%e A326852 (6321) (43321111)
%e A326852 (6411) (44221111)
%e A326852 (322221) (44311111)
%e A326852 (332211) (82111111)
%e A326852 (333111)
%e A326852 (422211)
%e A326852 (432111)
%e A326852 (441111)
%e A326852 (621111)
%t A326852 Table[Length[Select[IntegerPartitions[n],!SameQ@@#&&Divisible[n,Length[#]]&&Divisible[n,Max[#]]&]],{n,0,30}]
%Y A326852 The possibly constant case is A326843.
%Y A326852 The strict case is A326851.
%Y A326852 Cf. A018818, A047993, A067538, A326837, A326838, A326842, A326849.
%K A326852 nonn
%O A326852 0,13
%A A326852 _Gus Wiseman_, Jul 26 2019