|
%I #9 Jun 15 2019 11:15:09
%S 1,0,0,0,1,0,0,1,1,0,0,0,7,1,0,0,0,12,25,1,0,0,0,6,138,79,1,0,0,0,0,
%T 294,1056,241,1,0,0,0,0,270,5298,7050,727,1,0,0,0,0,90,12780,70350,
%U 44472,2185,1,0,0,0,0,0,16020,334710,817746,273378,6559,1,0,0,0,0,0
%N Square array T(k,n) by antidiagonals, where T(k,n) is number of ways of placing n identifiable nonnegative intervals with a total of exactly k starting and/or finishing points.
%C See A300729 for a triangular version of this array. - _Peter Bala_, Jun 13 2019
%H IBM Ponder This, <a href="http://domino.watson.ibm.com/Comm/wwwr_ponder.nsf/challenges/January2001.html">Jan 01 2001</a>
%F T(k, n) = T(k - 2, n - 1) * k * (k - 1)/2 + T(k - 1, n - 1) * k^2 + T(k, n - 1) * k * (k + 1)/2 with T(0, 0) = 1 = lambda(k, n) + lambda(k + 1, n) where lambda is A059117(k, n).
%e Rows are: 1,0,0,0,0,..., 0,1,1,0,0,..., 0,1,7,12,6,..., 0,1,25,138,294,..., etc. T(1,1)=1 since if a is starting point of interval and A is end point then only possibility is aA (zero length). T(2,1)=1 since possibility is a-A (positive length). T(3,2)=12 since possibilities are: aA-b-B, b-aA-B, b-B-aA, bB-a-A, a-bB-A, a-A-bB, ab-A-B, ab-B-A, a-b-AB, b-a-AB, a-bA-B, b-a-AB.
%Y Sum of rows gives A059516. Columns include A000007, A057427, A058481, A059117. Final positive number in each row is A000680.
%Y Cf. A300729.
%K nonn,tabl
%O 0,13
%A _Henry Bottomley_, Jan 19 2001
|
