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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010899 Minimal scope of a (6,n) difference triangle. 1
6, 19, 36, 60 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

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

LINKS

Table of n, a(n) for n=1..4.

J. B. Shearer, Difference Triangle Sets: Known optimal solutions.

J. B. Shearer, Difference Triangle Sets: Discoverers

CROSSREFS

A row or column of array in A234943.

Sequence in context: A063233 A063147 A031014 * A090381 A106398 A179986

Adjacent sequences:  A010896 A010897 A010898 * A010900 A010901 A010902

KEYWORD

nonn,hard,more

AUTHOR

N. J. A. Sloane.

STATUS

approved

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 December 11 23:44 EST 2019. Contains 329945 sequences. (Running on oeis4.)