login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005854 The coding-theoretic function A(n,10,6).
(Formerly M0228)
0
1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 5, 7, 7, 8, 9, 10, 13, 14, 16, 20, 25, 31, 31 (list; graph; refs; listen; history; text; internal format)
OFFSET
6,6
COMMENTS
Packing number D(n,6,2). Maximum number of edge-disjoint K_6'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
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, Table 3.
CROSSREFS
Sequence in context: A120195 A121279 A123577 * A169991 A035435 A169992
KEYWORD
nonn,hard,more
AUTHOR
EXTENSIONS
The version in the Encyclopedia of Integer Sequences had 1 instead of 2 at n=11.
a(29)-a(32) from Rob Pratt, Feb 26 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 06:57 EDT 2024. Contains 371265 sequences. (Running on oeis4.)