This site is supported by donations to The OEIS Foundation.



The OEIS Foundation is grateful to everyone who made a donation during our Annual Appeal.     Visit the new and spectacular Pictures from the OEIS page!

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119770 Number of different antimatroids on n labeled items. 1
1, 1, 3, 22, 485, 59386, 133059751, 64649980092538 (list; graph; refs; listen; history; text; internal format)



See link for software to generate the sequence. The next item (for n=8) should be roughly 2^78 and seems hopeless without more mathematics.

Antimatroids are a subset of greedoids, usually defined either in terms of set systems, as David Eppstein does in his tree searches, or in terms of formal languages. The two are equivalent, as discussed in Kempner and Levit. - Jonathan Vos Post, Jun 20 2006


Table of n, a(n) for n=0..7.

D. Eppstein, Reverse search for antimatroids.

Yulia Kempner, Vadim E. Levit, Correspondence Between Two Antimatroid Algorithmic Characterizations

P. Uznanski Enumeration of Antimatroids


E.g. the three antimatroids on the two items 0 and 1 are (a) {},{0},{0,1}, (b) {},{1},{0,1} and (c) {},{0},{1},{0,1}.


Cf. A224913 (counts antimatroids, taking symmetries into account).

Sequence in context: A259919 A196734 A156512 * A233748 A153230 A195462

Adjacent sequences:  A119767 A119768 A119769 * A119771 A119772 A119773




David Eppstein, Jun 19 2006


Term for n=6 added based on a computer search by Przemysław Uznański - David Eppstein, Feb 26 2013

Term for n=7 added by Przemyslaw Uznanski, computed by Przemysław Uznański and Michał Bartoszkiewicz, Apr 19 2013



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 9 18:45 EST 2016. Contains 268132 sequences.