login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A003041
Number of vacuously transitive relations on n nodes up to isomorphism.
(Formerly M1764)
3
2, 7, 24, 92, 388
OFFSET
1,1
COMMENTS
A transitive relation is vacuously transitive if it does not contain any transitive triple, that is, three distinct ordered pairs (a,b), (b,c), (a,c). - Jukka Kohonen, Sep 17 2021
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
H. Sharp, Jr., Enumeration of vacuously transitive relations, Discrete Math. 4 (1973), 185-196.
EXAMPLE
a(2)=7: The seven relations are {}, {(1,1)}, {(1,1),(2,2)}, {(2,1)}, {(1,1),(2,1)}, {(1,1),(2,1),(2,2)} and {(2,1),(2,2)}. - Jukka Kohonen, Sep 17 2021
CROSSREFS
Sequence in context: A150399 A150400 A150401 * A026558 A150402 A151295
KEYWORD
nonn,more
EXTENSIONS
Clarified and offset corrected by Jukka Kohonen, Sep 17 2021
STATUS
approved