A005677 - 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

A005677

Maximal size of equidistant permutation array R(n,1).
(Formerly M0722)

1, 1, 2, 3, 5, 10, 13, 16

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

OFFSET

1,3

REFERENCES

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

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

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

Fausto A. C. Cariboni, Lower bound with solution for a(9), Feb 17 2019.

Rudolf Mathon, Bounds for equidistant permutation arrays of index one, Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985), 303-309, Ann. New York Acad. Sci., 555, New York Acad. Sci., New York, 1989.

CROSSREFS

Cf. A013578.

Sequence in context: A129281 A289536 A022426 * A162404 A084760 A186082

Adjacent sequences: A005674 A005675 A005676 * A005678 A005679 A005680

KEYWORD

nonn,hard,nice

AUTHOR

N. J. A. Sloane

STATUS

approved