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

A053572
Maximal number of spanning trees in a planar graph with n nodes.
1
1, 1, 1, 3, 16, 75, 384, 1805, 8640, 42336, 207368, 995808, 5184000, 24192672, 121730700, 594350400, 2921811200
OFFSET
0,4
CROSSREFS
Sequence in context: A005947 A003769 A005386 * A329806 A371350 A309915
KEYWORD
nonn,nice,hard
AUTHOR
Brendan McKay, Jan 18 2000
STATUS
approved