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!)
A367772 Number of sets of nonempty subsets of {1..n} satisfying a strict version of the axiom of choice in more than one way. 11
0, 0, 1, 23, 1105 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
The axiom of choice says that, given any set of nonempty sets Y, it is possible to choose a set containing an element from each. The strict version requires this set to have the same cardinality as Y, meaning no element is chosen more than once.
LINKS
Wikipedia, Axiom of choice.
FORMULA
A367903(n) + A367904(n) + a(n) = A058891(n).
EXAMPLE
Non-isomorphic representatives of the a(3) = 23 set-systems:
{{1,2}}
{{1,2,3}}
{{1},{2,3}}
{{1},{1,2,3}}
{{1,2},{1,3}}
{{1,2},{1,2,3}}
{{1},{2,3},{1,2,3}}
{{1,2},{1,3},{2,3}}
{{1,2},{1,3},{1,2,3}}
MATHEMATICA
Table[Length[Select[Subsets[Subsets[Range[n]]], Length[Select[Tuples[#], UnsameQ@@#&]]>1&]], {n, 0, 3}]
CROSSREFS
For at least one choice we have A367902.
For no choices we have A367903, no singletons A367769, ranks A367907.
For a unique choice we have A367904, ranks A367908.
These set-systems have ranks A367909.
A000372 counts antichains, covering A006126, nonempty A014466.
A003465 counts covering set-systems, unlabeled A055621.
A058891 counts set-systems, unlabeled A000612.
Sequence in context: A126741 A273477 A202656 * A340487 A321569 A061063
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Dec 12 2023
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 April 29 14:42 EDT 2024. Contains 372114 sequences. (Running on oeis4.)