cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A005771 Number of n-covers of an unlabeled 5-set.

Original entry on oeis.org

1, 12, 103, 736, 4571, 25326, 127415, 588687, 2518997, 10053739, 37656707, 133084998, 445949359, 1422934989, 4340110439, 12697803333, 35744330644, 97081519369, 255032046536, 649459943602, 1606518048420, 3867119228081, 9073566868140, 20783186834063
Offset: 1

Views

Author

Keywords

Comments

Number of n X 5 binary matrices with at least one 1 in every column up to row and column permutations. - Andrew Howroyd, Feb 28 2023

References

  • R. J. Clarke, Covering a set by subsets, Discrete Math., 81 (1990), 147-152.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

A diagonal of A055080.
First differences give A055083.

Programs

Formula

a(n) = A052264(n) - A006148(n). - Andrew Howroyd, Feb 28 2023

Extensions

More terms from Vladeta Jovovic, Jun 13 2000
Terms a(21) and beyond from Andrew Howroyd, Feb 28 2023