login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053572 Maximal number of spanning trees in a planar graph with n nodes. 0
1, 1, 1, 3, 16, 75, 384, 1805, 8640, 42336, 207368, 995808, 5184000, 24192672, 121730700, 594350400, 2921811200 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

CROSSREFS

Sequence in context: A005947 A003769 A005386 * A055842 A037773 A037661

Adjacent sequences:  A053569 A053570 A053571 * A053573 A053574 A053575

KEYWORD

nonn,nice,hard

AUTHOR

Brendan McKay (bdm(AT)cs.anu.edu.au), Jan 18 2000

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.