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 A207365 #7 Jul 22 2025 20:20:36 %S A207365 13,169,624,2304,5856,14884,31110,65025,120105,221841,375858,636804, %T A207365 1011864,1607824,2430756,3674889,5338845,7756225,10906060,15335056, %U A207365 20981928,28708164,38379354,51308569,67239081,88115769,113488830 %N A207365 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically. %C A207365 Column 5 of A207368 %H A207365 R. H. Hardin, <a href="/A207365/b207365.txt">Table of n, a(n) for n = 1..210</a> %F A207365 Empirical: a(n) = 2*a(n-1) +6*a(n-2) -14*a(n-3) -14*a(n-4) +42*a(n-5) +14*a(n-6) -70*a(n-7) +70*a(n-9) -14*a(n-10) -42*a(n-11) +14*a(n-12) +14*a(n-13) -6*a(n-14) -2*a(n-15) +a(n-16) %e A207365 Some solutions for n=4 %e A207365 ..1..0..1..0..0....0..0..1..0..0....1..1..1..0..0....0..0..1..0..1 %e A207365 ..1..0..1..0..0....1..1..0..1..0....0..1..0..1..0....0..1..0..0..1 %e A207365 ..0..0..1..0..0....0..0..1..0..0....0..0..1..0..0....0..0..1..0..1 %e A207365 ..0..0..1..0..0....1..1..0..1..0....0..1..0..1..0....0..1..0..0..1 %K A207365 nonn %O A207365 1,1 %A A207365 _R. H. Hardin_ Feb 17 2012