Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053572
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A053572
%S A053572 1,1,1,3,16,75,384,1805,8640,42336,207368,995808,5184000,24192672,
%T A053572 121730700,594350400,2921811200
%N A053572 Maximal number of spanning trees in a planar graph with n nodes.
%Y A053572 Sequence in context: A005947 A003769 A005386 this_sequence A055842 A037773 
               A037661
%Y A053572 Adjacent sequences: A053569 A053570 A053571 this_sequence A053573 A053574 
               A053575
%K A053572 nonn,nice,hard
%O A053572 0,4
%A A053572 Brendan McKay (bdm(AT)cs.anu.edu.au), Jan 18 2000

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research