proposed
approved
proposed
approved
editing
proposed
First few rows: 0; 1,1; 1,1,1; 1,1,2,1,1; 1,1,2,1,2,1,1
First few rows:
0;
1,1;
1,1,1;
1,1,2,1,1;
1,1,2,1,2,1,1;
proposed
editing
editing
proposed
Michael De Vlieger, <a href="/A115722/b115722.txt">Table of n, a(n) for n = 0..11731</a> (rows 0 <= n <= 26).
{0}~Join~Array[Map[Block[{k = Length@ #}, While[Nand[k > 0, AllTrue[Take[#, k], # >= k &]], k--]; k] &, IntegerPartitions@ #] &, 10] // Flatten (* Michael De Vlieger, Jan 17 2020 *)
Michael De Vlieger, <a href="/A115722/b115722.txt">Table of n, a(n) for n = 0..11731</a>
approved
editing
Frank _Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), _, Mar 11 2006
E. W. Eric Weisstein, 's World of Mathematics, <a href="http://mathworld.wolfram.com/DurfeeSquare.html">Durfee Square.</a>
nonn,tabf,new
nonn,tabl,newtabf
Table of Durfee square of partitions in Mathematica order.
0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 2, 1, 2, 2, 1, 2
0,10
E. W. Weisstein, <a href="http://mathworld.wolfram.com/DurfeeSquare.html">Durfee Square.</a>
If partition is laid out in descending order p(1),p(2),...,p(k) without repetition factors (e.g. [3,2,2,1,1,1]), a(P) = max_k min(k,p(k)).
First few rows: 0; 1,1; 1,1,1; 1,1,2,1,1; 1,1,2,1,2,1,1
nonn,tabl
Frank Adams-Watters (FrankTAW(AT)Netscape.net), Mar 11 2006
approved