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 A218900 #8 Jul 23 2025 00:08:58 %S A218900 16,38,286,1096,6280,28598,149238,722094,3651696,18021788,90208322, %T A218900 448024152,2235168520,11123412124,55435126828,276050589212, %U A218900 1375270796150,6849815881386,34121765700892,169961133958828,846617625629670 %N A218900 Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 4Xn array. %C A218900 Row 4 of A218897 %H A218900 R. H. Hardin, <a href="/A218900/b218900.txt">Table of n, a(n) for n = 1..210</a> %F A218900 Empirical: a(n) = 3*a(n-1) +16*a(n-2) -16*a(n-3) -51*a(n-4) -107*a(n-5) -115*a(n-6) +457*a(n-7) +511*a(n-8) +617*a(n-9) -294*a(n-10) -2046*a(n-11) -1191*a(n-12) -307*a(n-13) +1059*a(n-14) +3506*a(n-15) -419*a(n-16) -2054*a(n-17) -800*a(n-18) -301*a(n-19) +699*a(n-20) +1069*a(n-21) +108*a(n-22) -403*a(n-23) -292*a(n-24) -177*a(n-25) +156*a(n-26) +98*a(n-27) +52*a(n-28) -72*a(n-29) +8*a(n-30) %e A218900 Some solutions for n=3 %e A218900 ..1..0..0....1..0..0....1..0..1....0..0..1....0..0..0....0..0..1....1..0..1 %e A218900 ..1..0..1....1..0..0....0..0..1....0..0..0....1..0..0....1..0..1....0..0..0 %e A218900 ..0..0..0....0..0..0....1..0..1....0..0..1....1..0..1....1..0..1....1..0..0 %e A218900 ..1..0..1....1..0..0....0..0..1....0..0..0....0..0..1....1..0..0....0..0..1 %K A218900 nonn %O A218900 1,1 %A A218900 _R. H. Hardin_ Nov 08 2012