%I #5 May 26 2024 16:01:45
%S 1,1,7,2160,3127853061
%N Number of edge subsets E of the n-dimensional hypercube graph such that E contains a path between two given antipodal nodes.
%C 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.
%Y Main diagonal of A373034.
%Y Cf. A061301, A372705, A373037.
%K nonn,more
%O 0,3
%A _Pontus von Brömssen_, May 20 2024