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 A317546 #6 Jul 31 2018 07:23:58
%S A317546 1,3,7,18,42,104,246,594,1416,3391,8084,19312,46041,109829,261827,
%T A317546 624254,1487981,3546883,8453770,20149014,48021864,114451536,272769936,
%U A317546 650084053,1549312743
%N A317546 Number of multimin partitions of integer partitions of n.
%C A317546 A multimin partition of m is an ordered multiset partition of m such that the minima of the blocks are weakly increasing.
%F A317546 a(n) = Sum_{k > 0 : A056239(k) = n} A317545(k).
%e A317546 The a(3) = 7 multimin partitions of integer partitions of 3:
%e A317546 (3),
%e A317546 (1)(2), (12),
%e A317546 (1)(1)(1), (1)(11), (11)(1), (111).
%e A317546 The a(4) = 18 multimin partitions of integer partitions of 4:
%e A317546 (4),
%e A317546 (1)(3), (13),
%e A317546 (2)(2), (22),
%e A317546 (1)(1)(2), (1)(12), (11)(2), (12)(1), (112),
%e A317546 (1)(1)(1)(1), (1)(1)(11), (1)(11)(1), (1)(111), (11)(1)(1), (11)(11), (111)(1), (1111).
%t A317546 mmcount[m_List]:=mmcount[m]=If[Length[m]===0,0,1+Plus@@mmcount/@Union[Subsets[Rest[m]]]];
%t A317546 Table[Sum[mmcount[Reverse[ptn]],{ptn,IntegerPartitions[n]}],{n,25}]
%Y A317546 Cf. A007716, A020639, A034691, A255397, A300335, A317545.
%K A317546 nonn
%O A317546 1,2
%A A317546 _Gus Wiseman_, Jul 31 2018