login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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.
3
1, 7, 1135, 3329245, 167176484530, 140386491543732211, 1946586793700869420041631, 442196286688432698682908745730140, 1637130627941780284200104764061689410361366, 98421463469915727265279069074012296351284158838933045, 95824439185976594319538143712857075522828165117771969008567719465
OFFSET
1,2
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.
LINKS
CROSSREFS
Main diagonal of A373036.
Sequence in context: A259251 A259253 A203871 * A144927 A202133 A229431
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(11) onwards from Eugene Nonko, Oct 28 2024
STATUS
approved