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 A325193 #7 Apr 12 2019 08:26:40
%S A325193 1,0,1,0,2,1,3,2,5,5,8,8,14,14,22,24,35,39,54,62,84,97,127,148,192,
%T A325193 224,284,334,418,492,610,716,880,1035,1259,1480,1790,2100,2522,2958,
%U A325193 3533,4135,4916,5742,6798,7928,9344,10878,12778,14846,17378,20156,23520
%N A325193 Number of integer partitions whose sum plus co-rank is n, where co-rank is maximum of length and largest part.
%H A325193 FindStat, <a href="http://www.findstat.org/StatisticsDatabase/St000784">St000784: The maximum of the length and the largest part of the integer partition</a>
%e A325193 The a(4) = 2 through a(12) = 14 partitions:
%e A325193 (2) (21) (3) (31) (4) (33) (5) (43) (6)
%e A325193 (11) (22) (211) (32) (41) (42) (51) (44)
%e A325193 (111) (221) (222) (322) (332) (52)
%e A325193 (311) (321) (331) (421) (333)
%e A325193 (1111) (2111) (411) (2221) (422)
%e A325193 (2211) (3211) (431)
%e A325193 (3111) (4111) (511)
%e A325193 (11111) (21111) (2222)
%e A325193 (3221)
%e A325193 (3311)
%e A325193 (4211)
%e A325193 (22111)
%e A325193 (31111)
%e A325193 (111111)
%t A325193 Table[Sum[Length[Select[IntegerPartitions[k],Max[Length[#],Max[#]]==n-k&]],{k,0,n}],{n,0,30}]
%Y A325193 Row sums of A325194.
%Y A325193 Cf. A051924, A065770, A071724, A096771, A115720, A252464, A257990, A263297, A325178, A325189, A325192.
%K A325193 nonn
%O A325193 0,5
%A A325193 _Gus Wiseman_, Apr 12 2019