|
%I #10 Dec 27 2021 21:54:00
%S 3,10,19,32,49,72,100
%N Minimal scope of a (3,n) difference triangle.
%D CRC Handbook of Combinatorial Designs, 1996, p. 315 (but beware errors).
%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(6) corrected from Shearer's tables. - _N. J. A. Sloane_, Jan 08 2014
|
