A371828 Number of labeled n-vertex hypergraphs (or set systems) that have a solution to the One Up puzzle.
1, 2, 7, 54, 993, 48868
Offset: 0
Examples
The following hypergraphs have solutions to the One Up puzzle. Only one such hypergraph for each isomorphism class is given, with the size of the isomorphism class in parentheses.
n = 0 n = 1 n = 2 n = 3
---------------------------------------------------
{} (1) {} (1) {} (1) {} (1)
{1} (1) {1} (2) {1} (3)
{12} (1) {12} (3)
{1,2} (1) {123} (1)
{1,12} (2) {1,2} (3)
{1,12} (6)
{1,23} (3)
{1,123} (3)
{12,13} (3)
{12,123} (3)
{1,2,3} (1)
{1,2,13} (6)
{1,12,13} (3)
{1,12,23} (6)
{1,12,123} (6)
{1,2,13,23} (3)
---------------------------------------------------
a(n): 1 2 7 54
Comments