|
%I #13 Jul 22 2017 09:14:53
%S 1,1,2,1,3,3,1,3,4,4,1,3,5,5,5,1,3,5,6,6,6,1,3,5,7,7,7,7,1,3,5,7,8,8,
%T 8,8,1,3,5,7,9,9,9,9,9,1,3,5,7,9,10,10,10,10,10,1,3,5,7,9,11,11,11,11,
%U 11,11,1,3,5,7,9,11,12,12,12,12,12,12,1,3,5,7,9,11,13,13,13,13,13,13,13,1,3,5,7,9,11,13,14,14,14,14,14,14,14,1,3,5,7,9,11,13,15,15,15,15,15,15,15,15,1,3,5,7,9,11,13,15,16,16,16,16,16,16,16,16,1,3,5,7,9,11,13,15,17,17,17,17,17,17,17,17,17,1,3,5,7,9,11,13,15,17
%N Array: T(n,k) = n-1 + min{n,k}, by antidiagonals.
%C A member of the accumulation chain ... < A185907 < A185908 < A185909 < ...
%C (See A144112 for definitions of weight array and accumulation array.)
%H G. C. Greubel, <a href="/A185908/b185908.txt">Table of n, a(n) for the first 50 rows, flattened</a>
%F T(n,k) = n-1 + min{n,k}, k >= 1, n >= 1.
%e Northwest corner:
%e 1, 1, 1, 1, 1
%e 2, 3, 3, 3, 3
%e 3, 4, 5, 5, 5
%e 4, 5, 6, 7, 7
%t (See A185907.)
%Y Cf. A144112, A185907, A185909.
%K nonn,tabl
%O 1,3
%A _Clark Kimberling_, Feb 06 2011
|
