login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013575 Minimal scope of an (n,3) difference triangle. 1

%I

%S 6,13,19,24,30,36,42,48,54,60,66,72,78,84,90

%N Minimal scope of an (n,3) difference triangle.

%D CRC Handbook of Combinatorial Designs, 1996, p. 315.

%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,more

%O 1,1

%A _N. J. A. Sloane_.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 02:15 EDT 2019. Contains 322380 sequences. (Running on oeis4.)