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 A218066 #8 Jul 22 2025 23:47:41 %S A218066 8,16,74,260,1046,3974,15578,60242,234468,910060,3536762,13737348, %T A218066 53371468,207332364,805465810,3129084596,12156035112,47224200410, %U A218066 183458638422,712707497212,2768755861210,10756176540402,41786039888224 %N A218066 Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 3Xn array. %C A218066 Row 3 of A218064 %H A218066 R. H. Hardin, <a href="/A218066/b218066.txt">Table of n, a(n) for n = 1..170</a> %F A218066 Empirical: a(n) = 2*a(n-1) +11*a(n-2) -7*a(n-3) -34*a(n-4) +11*a(n-5) +49*a(n-6) -14*a(n-7) -36*a(n-8) +7*a(n-9) +a(n-10) +8*a(n-11) +2*a(n-12) -13*a(n-13) +2*a(n-14) +4*a(n-15) for n>18 %e A218066 Some solutions for n=3 %e A218066 ..1..1..1....0..0..0....0..0..1....0..0..1....1..0..0....0..0..1....0..0..1 %e A218066 ..1..0..0....0..0..0....0..0..0....0..0..0....0..0..0....1..1..1....1..0..0 %e A218066 ..1..0..0....1..0..1....0..0..1....1..0..0....1..0..1....1..0..0....0..0..0 %K A218066 nonn %O A218066 1,1 %A A218066 _R. H. Hardin_ Oct 19 2012