login

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”).

A317194
Length of smallest cyclic covering word for covering (n-2)-subsets of an n-set.
1
3, 8, 13, 21, 28
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.
CROSSREFS
Cf. A317195.
Sequence in context: A352940 A322598 A363034 * A319128 A094110 A212649
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Aug 01 2018
STATUS
approved