|
| |
|
|
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.
|
|
2
|
|
|
|
1, 7, 1135, 3329245, 167176484530, 140386491543732211, 1946586793700869420041631, 442196286688432698682908745730140, 1637130627941780284200104764061689410361366, 98421463469915727265279069074012296351284158838933045
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
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
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
