|
|
A245633
|
|
Number of quenchable labeled spanning trees with n vertices.
|
|
0
|
|
|
|
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
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|