%I #8 Jan 06 2023 23:21:59
%S 36,3968,733512,116648336,17234589848,2481063626002,353883736096148,
%T 50301538415794232,7140496309756236272,1013108119964866470278,
%U 143713897214120554999482,20384925139787491684594856,2891390846534568194577474354,410109224260079991594244323232
%N Number of n X 8 binary arrays with all 1s connected and a path of 1s from top row to bottom row.
%H Andrew Howroyd, <a href="/A163034/b163034.txt">Table of n, a(n) for n = 1..200</a>
%H Chaim Goodman-Strauss, <a href="/A163029/a163029.pdf">Notes on the number of m × n binary arrays with all 1’s connected and a path of 1’s from top row to bottom row</a> (May 21 2020)
%H Chaim Goodman-Strauss, <a href="/A163029/a163029.nb">Mma notebook to accompany the above document</a>
%F For a formula see the Goodman-Strauss links. - _N. J. A. Sloane_, May 22 2020
%Y Column 8 of A359574.
%Y Cf. A163029-A163036.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jul 20 2009
%E Terms a(8) and beyond from _Andrew Howroyd_, Jan 06 2023