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 A207892 #7 Jul 22 2025 20:56:39 %S A207892 13,169,462,2446,11196,49442,231900,1070030,4844224,22421336, %T A207892 103071836,470766400,2169072096,9960748002,45637352134,209883232908, %U A207892 963579009422,4420355911200,20311365385702,93248420528358,427991086292782 %N A207892 Number of nX5 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically. %C A207892 Column 5 of A207895 %H A207892 R. H. Hardin, <a href="/A207892/b207892.txt">Table of n, a(n) for n = 1..210</a> %F A207892 Empirical: a(n) = 5*a(n-2) +93*a(n-3) +55*a(n-4) -155*a(n-5) -2310*a(n-6) -1767*a(n-7) +2530*a(n-8) +24479*a(n-9) +19496*a(n-10) -21724*a(n-11) -118048*a(n-12) -86251*a(n-13) +80928*a(n-14) +184661*a(n-15) +115235*a(n-16) -40224*a(n-17) +320280*a(n-18) +42178*a(n-19) -373429*a(n-20) -912968*a(n-21) +315033*a(n-22) +519645*a(n-23) -24244*a(n-24) -889210*a(n-25) +150839*a(n-26) +505015*a(n-27) +113924*a(n-28) -323459*a(n-29) +118395*a(n-30) +126286*a(n-31) -90095*a(n-32) +1380*a(n-33) +48458*a(n-34) +19414*a(n-35) -30712*a(n-36) +6513*a(n-37) +8418*a(n-38) -2051*a(n-39) -36*a(n-40) -309*a(n-41) -50*a(n-42) -274*a(n-43) +106*a(n-44) -94*a(n-45) +24*a(n-46) -3*a(n-47) for n>50 %e A207892 Some solutions for n=4 %e A207892 ..1..0..0..1..1....1..0..0..1..1....0..1..1..1..1....1..1..0..0..1 %e A207892 ..1..0..0..1..1....1..1..0..0..1....1..0..0..1..0....0..1..1..0..0 %e A207892 ..0..1..1..0..0....0..1..1..1..0....1..1..0..0..1....0..0..1..1..0 %e A207892 ..0..0..1..0..0....0..0..1..0..0....0..0..1..0..0....1..0..0..1..1 %K A207892 nonn %O A207892 1,1 %A A207892 _R. H. Hardin_ Feb 21 2012