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 A218061 #6 Jul 22 2025 23:47:21 %S A218061 10,108,1046,10246,99934,975296,9519284,92918894,907013406,8853740672, %T A218061 86425318934,843636853718,8235125319032,80386833101166, %U A218061 784692748485262,7659745900162448,74770293910981462,729867143111233166 %N A218061 Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 nX5 array. %C A218061 Column 5 of A218064 %H A218061 R. H. Hardin, <a href="/A218061/b218061.txt">Table of n, a(n) for n = 1..158</a> %F A218061 Empirical: a(n) = 15*a(n-1) -56*a(n-2) +37*a(n-3) +117*a(n-4) -132*a(n-5) -128*a(n-6) +164*a(n-7) +60*a(n-8) -76*a(n-9) -4*a(n-10) +8*a(n-11) for n>13 %e A218061 Some solutions for n=3 %e A218061 ..1..1..1..0..0....1..1..0..0..0....0..0..0..1..1....1..0..1..0..1 %e A218061 ..1..1..1..0..0....0..0..0..0..0....0..1..1..1..0....0..0..0..0..0 %e A218061 ..1..0..0..0..1....0..0..1..0..1....1..1..0..0..0....1..0..0..0..1 %K A218061 nonn %O A218061 1,1 %A A218061 _R. H. Hardin_ Oct 19 2012