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

%I

%S 1,1,1,3,16,75,384,1805,8640,42336,207368,995808,5184000,24192672,

%T 121730700,594350400,2921811200

%N Maximal number of spanning trees in a planar graph with n nodes.

%K nonn,nice,hard

%O 0,4

%A _Brendan McKay_, Jan 18 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 21:07 EDT 2019. Contains 321552 sequences. (Running on oeis4.)