|
%I #10 Mar 16 2020 16:32:12
%S 0,1,2,0,3,1,4,2,5,3,6,4,7,0,5,8,1,6,9,2,7,10,3,8,11,4,9,12,5,10,13,6,
%T 11,14,0,7,12,15,1,8,13,16,2,9,14,17,3,10,15,18,4,11,16,19,5,12,17,20,
%U 6,13,18,21,7,14,19,22,8,15,20,23,0,9,16,21,24,1
%N Irregular triangle T(n,k) = n - (s - k + 1)^2 for 1 <= k <= s, with s = floor(sqrt(n)).
%C Row n begins with n - floor(sqrt(n)).
%C Zero appears in row n for n that are perfect squares. Let r = sqrt(n). For perfect square n, there exists a partition of n that consists of a run of r parts that are each r themselves; e.g., for n = 4, we have {2, 2}, for n = 9, we have {3, 3, 3}. It is clear through the Ferrers diagram of these partitions that they are equivalent to their Durfee square, thus n - s^2 = 0.
%C Since the partitions of any n contain Durfee squares in the range of 1 <= s <= floor(sqrt(n)) (with perfect square n also including k = 0), the distinct Durfee square excesses must be the differences n - s^2 for 1 <= s <= floor(sqrt(n)).
%C We borrow the term "square excess" from A053186(n), which is simply the difference n - floor(sqrt(n)).
%C Row n of this sequence contains distinct Durfee square excesses among all integer partitions of n (see example below).
%H Michael De Vlieger, <a href="/A331478/b331478.txt">Table of n, a(n) for n = 1..10125</a> (rows 1 <= n <= 625, flattened)
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DurfeeSquare.html">Durfee Square.</a>
%F Let s = floor(sqrt(n));
%F T(n,1) = A053186(n) = n - s;
%F T(n,k) = T(n,1) + partial sums of 2(s - k + 1) + 1 for 2 <= k <= s + 1.
%F A000196(n) = Length of row n.
%F A022554(n) = Sum of row n.
%F Last term in row n = T(n, A000196(n)) = n - 1.
%e Table begins:
%e 1: 0;
%e 2: 1;
%e 3: 2;
%e 4: 0, 3;
%e 5: 1, 4;
%e 6: 2, 5;
%e 7: 3, 6;
%e 8: 4, 7;
%e 9: 0, 5, 8;
%e 10: 1, 6, 9;
%e 11: 2, 7, 10;
%e 12: 3, 8, 11;
%e 13: 4, 9, 12;
%e 14: 5, 10, 13;
%e 15: 6, 11, 14;
%e 16: 0, 7, 12, 15;
%e ...
%e For n = 4, the partitions are {4}, {3, 1}, {2, 2}, {2, 1, 1}, {1, 1, 1, 1}. The partition {2, 2} has Durfee square s = 2; for all partitions except {2, 2}, we have Durfee square with s = 1. Therefore we have two unique solutions to n - s^2 for n = 4, i.e., {0, 3}, so row 4 contains these values.
%t Array[# - Reverse@ Range[Sqrt@ #]^2 &, 625] // Flatten
%Y Cf. A000196, A022554, A053186, A117522.
%K nonn,easy,tabf
%O 1,3
%A _Michael De Vlieger_, Jan 17 2020
|
