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”).

A245633
Number of quenchable labeled spanning trees with n vertices.
0
1, 1, 2, 6, 28, 164, 1137, 8928, 76875, 710152
OFFSET
1,3
COMMENTS
a(n) is the number of prime implicants in the monotone Boolean function on n(n-1)/2 variables that characterizes quenchable graphs of order n.
REFERENCES
Quenchability will defined in an exercise of section 7.2.2.2 in The Art of Computer Programming, Volume 4B
CROSSREFS
Sequence in context: A356633 A109570 A262002 * A345367 A156626 A207386
KEYWORD
nonn
AUTHOR
Don Knuth, Jul 27 2014
STATUS
approved