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 A325343 #15 Dec 16 2024 02:08:12
%S A325343 1,0,1,2,3,4,7,9,14,19,27,36,50,65,87,114,149,192,249,316,404,510,643,
%T A325343 805,1008,1251,1553,1917,2361,2895,3546,4322,5262,6383,7728,9330,
%U A325343 11245,13512,16213,19405,23186,27643,32907,39089,46366,54894,64893,76584,90256
%N A325343 Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p).
%H A325343 Alois P. Heinz, <a href="/A325343/b325343.txt">Table of n, a(n) for n = 1..10000</a>
%F A325343 a(n) = A000041(n) - A003106(n) - A064173(n) for n > 0. - _Jason Yuen_, Dec 15 2024
%e A325343 a(7) counts these 7 partitions: {6,1}, {5,2}, {5,1,1}, {4,2,1}, {4,1,1,1}, {3,3,1}, {3,2,2}.
%t A325343 Table[Count[IntegerPartitions[n], q_ /; Min[q] <= Length[q] <= Max[q]], {n, 60}]
%Y A325343 Cf. A000041, A003106, A064173, A325340, A325341, A325342.
%K A325343 nonn
%O A325343 1,4
%A A325343 _Clark Kimberling_, Apr 21 2019