login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010898 Minimal scope of a (5,n) difference triangle. 1
5, 15, 30, 51, 79 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

CRC Handbook of Combinatorial Designs, 1996, p. 315. (But beware errors!)

LINKS

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

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: A028895 A194150 A246817 * A048065 A048021 A225325

Adjacent sequences:  A010895 A010896 A010897 * A010899 A010900 A010901

KEYWORD

nonn,hard

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Corrected from Shearer's tables. - N. J. A. Sloane, Jan 08 2014

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 4 08:08 EST 2020. Contains 338921 sequences. (Running on oeis4.)