cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A072615 Duplicate of A020871.

Original entry on oeis.org

0, 3, 16, 81, 392, 1815, 8112, 35301, 150544, 632043, 2620880, 10759353
Offset: 0

Views

Author

Keywords

A108941 Maximum number of spanning trees in a cubic graph on 2n vertices.

Original entry on oeis.org

16, 81, 392, 2000, 9800, 50421, 248832, 1265625, 6422000, 32710656
Offset: 2

Views

Author

Gordon F. Royle, Jul 20 2005

Keywords

Comments

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

Examples

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

Crossrefs

Cf. A020871.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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