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.

A329788 Total number of graceful labelings of connected graphs with n edges.

Original entry on oeis.org

1, 2, 6, 24, 116, 672, 4520, 35050, 303468, 2934652, 31145346, 361323708, 4535359000, 61431851046, 890284097146, 13784350300996
Offset: 1

Views

Author

N. J. A. Sloane, Dec 01 2019, based on email from Don Knuth, Dec 01 2019

Keywords

Comments

In general, consider a connected graph with E edges and V vertices. The vertices are given labels in the range 0 to E so that the differences between edges' endpoints are {1,...,E}. None of the vertices are isolated; hence each vertex label participates in at least one edge. For this sequence V is unrestricted and E = n.

Links

Crossrefs

Cf. A033472 (V=E+1), A329789 (V=E). A diagonal of the triangle in A329790.

A329789 Total number of graceful labelings of connected graphs with n vertices and n edges.

Original entry on oeis.org

0, 0, 2, 12, 68, 400, 2496, 17338, 127660, 1030524, 8852398, 82121018, 806839236, 8481362264, 93933923996, 1104325114202
Offset: 1

Views

Author

N. J. A. Sloane, Dec 01 2019, based on email from Don Knuth, Dec 01 2019

Keywords

Comments

In general, consider a connected graph with E edges and V vertices. The vertices are given labels in the range 0 to E so that the differences between edges' endpoints are {1,...,E}. None of the vertices are isolated; hence each vertex label participates in at least one edge. For this sequence E = V = n.

Links

Crossrefs

Cf. A033472 (V=E+1), A329788 (any V). A diagonal of the triangle in A329790.
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.