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-3 of 3 results.

A343209 Number of spanning trees of the graph of the n-th Johnson solid.

Original entry on oeis.org

45, 121, 1815, 24000, 297025, 78250050, 361, 3509, 30976, 27216, 403202, 75, 1805, 1728, 31500, 508805, 207368, 1609152, 227402340, 29821320745, 8223103375490, 37158912, 15482880000, 5996600870820, 1702422879696000, 1176, 324900, 29859840, 30950832, 2518646460
Offset: 1

Views

Author

Pontus von Brömssen, Apr 08 2021

Keywords

Comments

Terms are taken from the paper by Horiyama and Shoji, verified by Pontus von Brömssen.

Examples

			The gyrobifastigium (J26) has a(26) = 1176 spanning trees.
		

Crossrefs

A343432 Sorted numbers of spanning trees in the graphs of the Archimedean solids.

Original entry on oeis.org

6000, 331776, 32400000, 101154816, 301056000000, 89904012853248, 208971104256000, 12418325780889600, 4982259375000000000, 375291866372898816000, 201550864919150779950956544000, 438201295386966498858139607040000000, 21789262703685125511464767107171876864000
Offset: 1

Views

Author

Pontus von Brömssen, Apr 15 2021

Keywords

Comments

The duals (Catalan solids) have the same number of spanning trees as their Archimedean counterparts.

Examples

			The solids are in order:
  truncated tetrahedron (6000),
  cuboctahedron (331776),
  truncated cube (32400000),
  truncated octahedron (101154816),
  rhombicuboctahedron (301056000000),
  snub cube (89904012853248),
  icosidodecahedron (208971104256000),
  truncated cuboctahedron (12418325780889600),
  truncated dodecahedron (4982259375000000000),
  truncated icosahedron (375291866372898816000),
  rhombicosidodecahedron (201550864919150779950956544000),
  snub dodecahedron (438201295386966498858139607040000000),
  truncated icosidodecahedron (21789262703685125511464767107171876864000).
		

Crossrefs

A358960 Number of directed Hamiltonian paths of the Platonic graphs (in the order of tetrahedral, cubical, octahedral, dodecahedral, and icosahedral graph).

Original entry on oeis.org

24, 144, 240, 3240, 75840
Offset: 1

Views

Author

Seiichi Manyama, Dec 07 2022

Keywords

Comments

a(n)/2 is the number of undirected Hamiltonian paths of the Platonic graph corresponding to a(n).
From symmetry, a(n) is a multiple of A063723(n).

Crossrefs

Showing 1-3 of 3 results.