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