login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108941 Maximum number of spanning trees in a cubic graph on 2n vertices. 0
16, 81, 392, 2000, 9800, 50421, 248832, 1265625, 6422000, 32710656 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

COMMENTS

a(5) = 2000 is realized by Petersen graph, a(7) = 50421 is realized by the Heawood graph.

LINKS

Table of n, a(n) for n=2..11.

EXAMPLE

When n=2, the only cubic graph on 2n vertices is the complete graph K4 with 16 spanning trees.

CROSSREFS

Cf. A020871.

Sequence in context: A134606 A343324 A343284 * A153157 A113849 A046453

Adjacent sequences: A108938 A108939 A108940 * A108942 A108943 A108944

KEYWORD

nonn,more

AUTHOR

Gordon F. Royle, Jul 20 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 14:22 EST 2022. Contains 358362 sequences. (Running on oeis4.)