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 A325181 #11 Apr 15 2019 01:38:05
%S A325181 0,0,2,1,0,2,3,2,1,0,2,3,4,3,2,1,0,2,3,4,5,4,3,2,1,0,2,3,4,5,6,5,4,3,
%T A325181 2,1,0,2,3,4,5,6,7,6,5,4,3,2,1,0,2,3,4,5,6,7,8,7,6,5,4,3,2,1,0,2,3,4,
%U A325181 5,6,7,8,9,8,7,6,5,4,3,2,1,0,2,3,4,5,6
%N A325181 Number of integer partitions of n such that the difference between the length of the minimal square containing and the maximal square contained in the Young diagram is 1.
%C A325181 The maximal square contained in the Young diagram of an integer partition is called its Durfee square, and its length is the rank of the partition.
%H A325181 Giovanni Resta, <a href="/A325181/b325181.txt">Table of n, a(n) for n = 0..150</a>
%e A325181 The a(2) = 2 through a(15) = 1 partitions:
%e A325181 (2) (21) (32) (33) (322) (332) (433) (443) (444) (4333) (4433) (4443)
%e A325181 (11) (221) (222) (331) (3331) (3332) (3333) (4432) (4442)
%e A325181 (321) (4331) (4332) (4441)
%e A325181 (4431)
%t A325181 durf[ptn_]:=Length[Select[Range[Length[ptn]],ptn[[#]]>=#&]];
%t A325181 codurf[ptn_]:=Max[Length[ptn],Max[ptn]];
%t A325181 Table[Length[Select[IntegerPartitions[n],codurf[#]-durf[#]==1&]],{n,0,30}]
%Y A325181 Cf. A006918, A084835, A096771, A257990, A263297, A325178, A325179, A325182, A325191, A325192, A325198.
%K A325181 nonn,look
%O A325181 0,3
%A A325181 _Gus Wiseman_, Apr 08 2019
%E A325181 More terms from _Giovanni Resta_, Apr 15 2019