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 A207463 #7 Apr 22 2021 14:11:42 %S A207463 9,81,271,1307,5369,23645,101233,439063,1893511,8183735,35331965, %T A207463 152610763,659074589,2846603441,12294305751,53098868971,229330454403, %U A207463 990464516749,4277755155395,18475391521815,79794234969705 %N A207463 Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 0 and 1 0 1 vertically. %C A207463 Column 4 of A207467. %H A207463 R. H. Hardin, <a href="/A207463/b207463.txt">Table of n, a(n) for n = 1..210</a> %F A207463 Empirical: a(n) = 9*a(n-1) -36*a(n-2) +84*a(n-3) -78*a(n-4) +26*a(n-5) +73*a(n-6) -265*a(n-7) +2209*a(n-8) -5829*a(n-9) +3375*a(n-10) +251*a(n-11) -117*a(n-12) -16643*a(n-13) -36823*a(n-14) +143237*a(n-15) +54901*a(n-16) -60997*a(n-17) -150479*a(n-18) +297239*a(n-19) +258172*a(n-20) -1573218*a(n-21) -2093803*a(n-22) +381335*a(n-23) +5018995*a(n-24) +4849153*a(n-25) -411771*a(n-26) -5472175*a(n-27) -5799032*a(n-28) -1965470*a(n-29) +1329443*a(n-30) +3307749*a(n-31) +2930682*a(n-32) +1635174*a(n-33) -292785*a(n-34) -1200175*a(n-35) -1111888*a(n-36) -432020*a(n-37) +60503*a(n-38) +216919*a(n-39) +166949*a(n-40) +69937*a(n-41) +10171*a(n-42) -12109*a(n-43) -9539*a(n-44) -3713*a(n-45) -286*a(n-46) +286*a(n-47) +144*a(n-48) +24*a(n-49). %e A207463 Some solutions for n=4 %e A207463 ..1..1..0..1....1..0..0..1....1..1..0..0....0..0..1..0....1..1..1..1 %e A207463 ..0..1..0..1....0..1..0..0....1..0..0..1....1..1..0..1....1..1..1..1 %e A207463 ..0..0..1..0....0..1..0..0....1..0..0..1....1..1..0..1....1..1..1..1 %e A207463 ..0..0..1..0....1..1..1..1....0..0..1..0....0..1..0..1....1..0..1..0 %Y A207463 Cf. A207467. %K A207463 nonn %O A207463 1,1 %A A207463 _R. H. Hardin_ Feb 18 2012