|
%I M0268 #38 Feb 27 2024 18:40:21
%S 1,1,1,1,2,2,2,3,3,4,6,6,7,9,12,16,21,21,23,24,30,30
%N The coding-theoretic function A(n,8,5).
%C Packing number D(n,5,2). Maximum number of edge-disjoint K_5's in a K_n. - _Rob Pratt_, Feb 26 2024
%D CRC Handbook of Combinatorial Designs, 1996, p. 411.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A. E. Brouwer, <a href="http://www.win.tue.nl/~aeb/codes/Andw.html">Bounds for binary constant weight codes</a>
%H A. E. Brouwer, J. B. Shearer, N. J. A. Sloane and W. D. Smith, <a href="http://dx.doi.org/10.1109/18.59932">New table of constant weight codes</a>, IEEE Trans. Info. Theory 36 (1990), 1334-1380.
%H Alice Miller and Michael Codish, <a href="https://arxiv.org/abs/1708.06576">Graphs with girth at least 5 with orders between 20 and 32</a>, arXiv:1708.06576 [math.CO], 2017.
%H <a href="/index/Aa#Andw">Index entries for sequences related to A(n,d,w)</a>
%Y Cf. A005852: A(n,8,6), A005853: A(n,8,7), A004043: A(n,8,8).
%Y Cf. A005866: A(n,8).
%K nonn,hard,more
%O 5,5
%A _N. J. A. Sloane_.
%E The version in the Encyclopedia of Integer Sequences had 1 instead of 2 at n=9.
|
