A072445 Number of subsets S of the power set P{1,2,...,n} such that: {1}, {2},..., {n} are all elements of S; {1,2,...,n} is an element of S; if X and Y are elements of S and X and Y have a nonempty intersection, then the union of X and Y is an element of S. The sets S are counted modulo permutations on the elements 1,2,...,n.
1, 1, 1, 4, 40, 3044, 26894586
Offset: 0
Examples
a(3) = 4 because of the 4 sets: {{1}, {2}, {3}, {1, 2, 3}}; {{1}, {2}, {3}, {1, 2}, {1, 2, 3}}; {{1}, {2}, {3}, {1, 2}, {1, 3}, {1, 2, 3}}; {{1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}.
Links
Crossrefs
Formula
Inverse Euler transform of A072444. - Andrew Howroyd, Oct 28 2023
Extensions
a(0)=1 prepended and a(6) corrected by Andrew Howroyd, Oct 28 2023
Comments