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.

A373037 Number of edge subsets E of the n X n square grid graph such that E contains a path between the top left node and the bottom right node.

Original entry on oeis.org

1, 7, 1135, 3329245, 167176484530, 140386491543732211, 1946586793700869420041631, 442196286688432698682908745730140, 1637130627941780284200104764061689410361366, 98421463469915727265279069074012296351284158838933045, 95824439185976594319538143712857075522828165117771969008567719465
Offset: 1

Views

Author

Pontus von Brömssen, May 20 2024

Keywords

Comments

a(n)/A053765(n) is the probability that the top left and bottom right vertices of the n X n square grid graph are still connected after each edge has been independently deleted with probability 1/2.

Crossrefs

Main diagonal of A373036.

Extensions

a(11) onwards from Eugene Nonko, Oct 28 2024