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 A218893 #6 Dec 29 2023 10:04:41 %S A218893 6,34,212,1096,6422,35812,202662,1143320,6451714,36412818,205486910, %T A218893 1159668470,6544517458,36933689524,208433556616,1176284907448, %U A218893 6638308849796,37462983914486,211420591173616,1193142178688764 %N A218893 Number of n X 4 arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 n X 4 array. %C A218893 Column 4 of A218897. %H A218893 R. H. Hardin, <a href="/A218893/b218893.txt">Table of n, a(n) for n = 1..210</a> %F A218893 Empirical: a(n) = 6*a(n-1) +3*a(n-2) -25*a(n-3) -29*a(n-4) +53*a(n-5) +33*a(n-6) +12*a(n-7) -38*a(n-8) -18*a(n-10) +12*a(n-11) -15*a(n-12) +7*a(n-13) +4*a(n-14). %e A218893 Some solutions for n=3 %e A218893 ..1..0..1..1....0..0..0..0....1..1..1..1....1..1..0..0....1..1..1..1 %e A218893 ..0..0..1..0....0..0..0..0....0..0..0..0....0..0..0..0....0..1..0..1 %e A218893 ..1..0..0..0....1..1..1..1....0..0..0..0....0..0..0..1....0..0..0..1 %Y A218893 Cf. A218897. %K A218893 nonn %O A218893 1,1 %A A218893 _R. H. Hardin_, Nov 08 2012