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.
%I A163030 #11 Jul 22 2025 06:58:12 %S A163030 10,88,920,9362,94280,947760,9528128,95797726,963186740,9684246062, %T A163030 97369020768,978984263266,9843070964036,98965887676178, %U A163030 995039757124590,10004498940354450,100588944638377056,1011358574138112578 %N A163030 Number of nX4 binary arrays with all 1s connected and a path of 1s from top row to bottom row. %H A163030 R. H. Hardin, <a href="/A163030/b163030.txt">Table of n, a(n) for n=1..44</a> %H A163030 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 A163030 Chaim Goodman-Strauss, <a href="/A163029/a163029.nb">Mma notebook to accompany the above document</a> %F A163030 Empirical: a(n)= 15*a(n-1) -59*a(n-2) +97*a(n-3) -19*a(n-4) -210*a(n-5) +222*a(n-6) +22*a(n-7) -113*a(n-8) +7*a(n-9) -71*a(n-10) +13*a(n-11) +a(n-12). [From _R. J. Mathar_, Aug 11 2009] %F A163030 For a proof see the Goodman-Strauss links. - _N. J. A. Sloane_, May 22 2020 %Y A163030 Cf. A163029-A163036. %K A163030 nonn %O A163030 1,1 %A A163030 _R. H. Hardin_ Jul 20 2009