|
%I #12 Aug 26 2017 05:08:51
%S 2,7,13,22,34,51,70,94,121,153
%N Minimal scope of a (2,n) difference triangle.
%D CRC Handbook of Combinatorial Designs, 1996, p. 315.
%D CRC Handbook of Combinatorial Designs, Second Edition, 2007, par. 19.37.
%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>
%Y A row or column of array in A234943.
%K nonn,hard
%O 1,1
%A _N. J. A. Sloane_
%E a(10) from _Andrey Zabolotskiy_, Aug 22 2017
|
