A005851 The coding-theoretic function A(n,8,5). (Formerly M0268)

1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 6, 6, 7, 9, 12, 16, 21, 21, 23, 24, 30, 30

Offset

5,5

Comments

Packing number D(n,5,2). Maximum number of edge-disjoint K_5's in a K_n. - Rob Pratt, Feb 26 2024

References

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

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=5..26.

A. E. Brouwer, Bounds for binary constant weight codes

A. E. Brouwer, J. B. Shearer, N. J. A. Sloane and W. D. Smith, New table of constant weight codes, IEEE Trans. Info. Theory 36 (1990), 1334-1380.

Alice Miller and Michael Codish, Graphs with girth at least 5 with orders between 20 and 32, arXiv:1708.06576 [math.CO], 2017.

Index entries for sequences related to A(n,d,w)

Crossrefs

Cf. A005852: A(n,8,6), A005853: A(n,8,7), A004043: A(n,8,8).

Cf. A005866: A(n,8).

Sequence in context: A341455 A341457 A341460 * A369786 A275247 A369764

Adjacent sequences: A005848 A005849 A005850 * A005852 A005853 A005854

Keyword

nonn,hard,more

Author

N. J. A. Sloane.

Extensions

The version in the Encyclopedia of Integer Sequences had 1 instead of 2 at n=9.

Status

approved