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!)
A348260 Number of inequivalent maximal antichains of the Boolean lattice on a set of n elements. 3
1, 2, 3, 5, 10, 30, 233, 35925 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
a(n) is the number of orbits for the corresponding families of maximal antichains (see also A326358) of the powerset of {1,2,...,n} under the action of the symmetry group S_n.
LINKS
Dmitry I. Ignatov, On the Number of Maximal Antichains in Boolean Lattices for n up to 7. Lobachevskii J. Math., 44 (2023), 137-146.
EXAMPLE
The a(0)=1 maximal antichains is {}.
The a(1)=2 maximal antichains are {}, {1}.
The a(2)=3 maximal antichains {}, {1}{2}, {12}.
Representatives of the a(3)=5 maximal antichains are: {}, {1}{2}{3}, {12}{3}, {12}{13}{23}, {123}.
Representatives of the a(4)=10 maximal antichains are:
{}, {1}{2}{3}{4},
{12}{3}{4}, {12}{13}{23}{4},
{123}{4}, {12}{13}{24}{14}{24}{34},
{123}{14}{24}{34}, {123}{124}{34},
{123}{124}{134}{234}, {1234}.
CROSSREFS
Cf. A003182 (not necessarily maximal), A326358 (labeled case).
Sequence in context: A213169 A330333 A003182 * A363257 A344347 A134294
KEYWORD
nonn,more
AUTHOR
Dmitry I. Ignatov, Oct 13 2021
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 May 7 21:53 EDT 2024. Contains 372317 sequences. (Running on oeis4.)