cp's OEIS Frontend

A234944 Array read by antidiagonals: T(i,j) = number of different optimal difference triangle sets M(i,j).

%I A234944 #16 Nov 30 2016 22:27:35
%S A234944 1,1,1,1,3,1,1,12,2,2,1,8,9,1,4,1,21,12,4,2,5,1,720,174,6,3,2,1,1,
%T A234944 4079,3132,92,1,4,1,1,1,3040,71930,117
%N A234944 Array read by antidiagonals: T(i,j) = number of different optimal difference triangle sets M(i,j).
%C A234944 This array gives the number of different ways to choose the optimal difference triangle sets M(i,j) described in A234943.
%H A234944 J. B. Shearer, <a href="http://www.research.ibm.com/people/s/shearer/dtsopt.html">Difference Triangle Sets: Known optimal solutions</a>.
%H A234944 J. B. Shearer, <a href="http://www.research.ibm.com/people/s/shearer/dtslb.html">Difference Triangle Sets: Discoverers</a>
%e A234944 Array begins:
%e A234944 j\i| 1,  2,  3,   4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
%e A234944 -----------------------------------------------------------------
%e A234944 1  | 1,   1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,  1,   1,   1 (A000012)
%e A234944 2  | 1,   3,   12,   8,  21, 720, 4079, 3040, 20505, 1669221, 14708525, 10567748,  (A234947)
%e A234944 3  | 1,   2,    9,  12, 174, 3132, 71930,   (A234945)
%e A234944 4  | 2,   1,    4,   6,  92, 117,   (A234946)
%e A234944 5  | 4,   2,    3,   1,
%e A234944 6  | 5,   2,    4,   4,
%e A234944 7  | 1,   1,    1,
%e A234944 8  | 1,   2,
%e A234944 9  | 1,   1,
%e A234944 10 | 2,
%e A234944 11 | 1
%e A234944 12 | 1
%e A234944 13 | 1
%e A234944 14 | 1
%e A234944 15 | 1
%e A234944 The entries match those in A234943.
%Y A234944 Rows give A234947, A234945, A234946.
%Y A234944 Cf. A234943.
%K A234944 nonn,tabl,more
%O A234944 1,5
%A A234944 _N. J. A. Sloane_, Jan 08 2014