The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A003465 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A003465

Number of ways to cover an n-set.
(history; published version)

#86 by Michel Marcus at Tue May 14 07:06:46 EDT 2024

STATUS

reviewed

approved

#85 by Joerg Arndt at Tue May 14 02:26:56 EDT 2024

STATUS

proposed

reviewed

#84 by Michel Marcus at Mon May 13 10:41:16 EDT 2024

STATUS

editing

proposed

#83 by Michel Marcus at Mon May 13 10:41:13 EDT 2024

CROSSREFS

Cf. A000110.

#82 by Michel Marcus at Mon May 13 10:40:50 EDT 2024

LINKS

M. Martin Klazar, <a href="https://arxiv.org/abs/math/0305048">Extremal problems for ordered hypergraphs</a>, arXiv:math/0305048 [math.CO], 2003.

STATUS

proposed

editing

#81 by Manfred Boergens at Mon May 13 08:10:19 EDT 2024

STATUS

editing

proposed

#80 by Manfred Boergens at Mon May 13 08:09:56 EDT 2024

COMMENTS

For disjoint covers see A000110. - Manfred Boergens, May 13 2024

STATUS

approved

editing

#79 by Michael De Vlieger at Mon Jan 31 06:47:37 EST 2022

STATUS

reviewed

approved

#78 by Joerg Arndt at Mon Jan 31 03:09:18 EST 2022

STATUS

proposed

reviewed

#77 by Michel Marcus at Mon Jan 31 02:35:08 EST 2022

STATUS

editing

proposed