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 A207114 #7 Jul 22 2025 20:02:12 %S A207114 10,100,350,1271,4047,10898,30415,77326,194952,486102,1177409,2870021, %T A207114 6897378,16540251,39654080,94561950,225894824,538481145,1283102003, %U A207114 3058471278,7283180531,17351112080,41324155722,98410550808,234389583427 %N A207114 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically. %C A207114 Row 5 of A207111 %H A207114 R. H. Hardin, <a href="/A207114/b207114.txt">Table of n, a(n) for n = 1..210</a> %F A207114 Empirical: a(n) = a(n-1) +9*a(n-2) +2*a(n-3) -45*a(n-4) -38*a(n-5) +103*a(n-6) +166*a(n-7) -90*a(n-8) -319*a(n-9) -86*a(n-10) +254*a(n-11) +207*a(n-12) +52*a(n-13) +50*a(n-14) -151*a(n-15) -425*a(n-16) -170*a(n-17) +375*a(n-18) +403*a(n-19) -9*a(n-20) -227*a(n-21) -147*a(n-22) -27*a(n-23) +50*a(n-24) +79*a(n-25) +29*a(n-26) -28*a(n-27) -26*a(n-28) +2*a(n-29) +7*a(n-30) +a(n-31) -a(n-32) %e A207114 Some solutions for n=4 %e A207114 ..1..0..0..1....0..1..0..1....0..0..1..0....1..1..1..0....0..1..0..0 %e A207114 ..0..1..0..0....0..1..0..0....0..1..0..1....1..0..1..0....0..1..0..1 %e A207114 ..1..0..0..1....0..1..0..1....0..0..1..0....1..1..1..0....0..1..0..0 %e A207114 ..1..1..0..1....0..1..0..1....0..1..0..1....1..1..1..0....0..1..0..0 %e A207114 ..1..1..0..1....0..1..0..1....0..1..0..1....1..1..1..0....0..1..0..0 %K A207114 nonn %O A207114 1,1 %A A207114 _R. H. Hardin_ Feb 15 2012