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.

A372705 Number of connected spanning subgraphs of the n-dimensional hypercube graph.

Original entry on oeis.org

1, 1, 5, 1083, 1239326145
Offset: 0

Views

Author

Pontus von Brömssen, May 11 2024

Keywords

Comments

a(n)/A061301(n) is the probability that the n-dimensional hypercube graph is still connected after each edge has been independently deleted with probability 1/2.

Crossrefs

Cf. A006237, A061301, A290758, A359992, A373034, A373035.

A373035 Number of edge subsets E of the n-dimensional hypercube graph such that E contains a path between two given antipodal nodes.

Original entry on oeis.org

1, 1, 7, 2160, 3127853061
Offset: 0

Views

Author

Pontus von Brömssen, May 20 2024

Keywords

Comments

a(n)/A061301(n) is the probability that two given antipodal nodes of the n-dimensional hypercube graph are still connected after each edge has been independently deleted with probability 1/2.

Crossrefs

Main diagonal of A373034.
Cf. A061301, A372705, A373037.
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.