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

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

Offset

1,3

References

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

Patric R. J. Östergård and Luka Tolonen, Classifying Equidistant Permutation Codes (in preparation).

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..9.

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: A289536 A022426 A162404 * A084760 A186082 A103746

Adjacent sequences: A005674 A005675 A005676 * A005678 A005679 A005680

Keyword

nonn,hard,nice,more

Author

N. J. A. Sloane

Extensions

a(9) from Luka Tolonen, Mar 14 2026

Status

approved