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.

A085549 Number of isomorphism classes of connected 4-regular multigraphs of order n, loops allowed.

Original entry on oeis.org

1, 2, 4, 10, 28, 97, 359, 1635, 8296, 48432, 316520, 2305104, 18428254, 160384348, 1506613063, 15180782537, 163211097958, 1864251304892, 22540603640086, 287577260214946, 3860595341568062, 54397355465967057, 802684717378090204
Offset: 1

Views

Author

Benjamin A. Burton (bab(AT)debian.org), Jul 04 2003

Keywords

Comments

Also the number of different potential face pairing graphs for closed 3-manifold triangulations.
Computed from A129429 by an inverse Euler transform. - R. J. Mathar, Mar 09 2019

References

  • B. A. Burton, Minimal triangulations and face pairing graphs, preprint, 2003.

Crossrefs

Programs

  • Mathematica
    A129429 = Cases[Import["https://oeis.org/A129429/b129429.txt", "Table"], {, }][[All, 2]];
    (* EulerInvTransform is defined in A022562 *)
    EulerInvTransform[A129429] (* Jean-François Alcover, Dec 03 2019, updated Mar 17 2020 *)

Formula

Inverse Euler transform of A129429.

Extensions

a(12)-a(16) from Brendan McKay, Apr 15 2007, computed using software at http://users.cecs.anu.edu.au/~bdm/nauty/
Edited by N. J. A. Sloane, Oct 01 2007
a(17)-a(23) from A129429 from Jean-François Alcover, Dec 03 2019