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!)
A235604 Number of equivalence classes of lattices of subsets of the power set 2^[n]. 0
1, 1, 1, 4, 50, 7443, 95239971 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
This is also the number of inequivalent atomic lattices on n atoms or inequivalent strict closure systems under T1 separation axiom on n elements. - Dmitry I. Ignatov, Sep 27 2022
LINKS
Donald M. Davis, Enumerating lattices of subsets, arXiv preprint arXiv:1311.6664 [math.CO], 2013.
CROSSREFS
The number of inequivalent closure operators on a set of n elements where all singletons are closed is given in A355517.
The number of all strict closure operators is given in A102894.
For T_1 closure operators, see A334254.
Sequence in context: A327229 A231832 A193157 * A221477 A122464 A226375
KEYWORD
nonn,more,hard
AUTHOR
N. J. A. Sloane, Jan 21 2014
EXTENSIONS
a(5) from Andrew Weimholt, Jan 27 2014
a(6) from Dmitry I. Ignatov, Sep 27 2022
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 June 2 13:38 EDT 2023. Contains 363097 sequences. (Running on oeis4.)