A317195 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A317195

Length of smallest linear covering word for covering (n-2)-subsets of an n-set.

3, 8, 13, 20, 29, 38

(list; graph; refs; listen; history; text; internal format)

OFFSET

3,1

REFERENCES

Stevens, B., Buskell, P., Ecimovic, P., Ivanescu, C., Malik, A.M., Savu, A., Vassilev, T.S., Verrall, H., Yang, B. and Zhao, Z., 2002. Solution of an outstanding conjecture: the non-existence of universal cycles with k = n- 2. Discrete Mathematics, 258(1-3), pp. 193-204.

LINKS

Table of n, a(n) for n=3..8.

CROSSREFS

Cf. A317194.

Sequence in context: A335869 A303592 A120883 * A352940 A322598 A363034

Adjacent sequences: A317192 A317193 A317194 * A317196 A317197 A317198

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Aug 01 2018

STATUS

approved