id:A053572 - OEIS Search Results

Search: id:A053572

Displaying 1-1 of 1 results found.

page 1

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

+0
1

1, 1, 1, 3, 16, 75, 384, 1805, 8640, 42336, 207368, 995808, 5184000, 24192672, 121730700, 594350400, 2921811200 (list; graph; listen)

	OFFSET	`0,4`
	CROSSREFS	`Sequence in context: A005947 A003769 A005386 this_sequence A055842 A037773 A037661` `Adjacent sequences: A053569 A053570 A053571 this_sequence A053573 A053574 A053575`
	KEYWORD	`nonn,nice,hard`
	AUTHOR	`Brendan McKay (bdm(AT)cs.anu.edu.au), Jan 18 2000`

page 1

Search completed in 0.002 seconds

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.