cp's OEIS Frontend

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.

A202097 Number of (n+2)X7 binary arrays avoiding patterns 001 and 011 in rows and columns.

This page as a plain text file.
%I A202097 #7 Jul 22 2025 16:29:03
%S A202097 3000,22500,105000,490000,1715000,6002500,17287200,49787136,124467840,
%T A202097 311169600,698544000,1568160000,3234330000,6670805625,12847477500,
%U A202097 24743290000,45032787800,81959673796,142244061960,246869859600
%N A202097 Number of (n+2)X7 binary arrays avoiding patterns 001 and 011 in rows and columns.
%C A202097 Column 5 of A202100
%H A202097 R. H. Hardin, <a href="/A202097/b202097.txt">Table of n, a(n) for n = 1..210</a>
%F A202097 Empirical: a(n) = 2*a(n-1) +12*a(n-2) -26*a(n-3) -65*a(n-4) +156*a(n-5) +208*a(n-6) -572*a(n-7) -429*a(n-8) +1430*a(n-9) +572*a(n-10) -2574*a(n-11) -429*a(n-12) +3432*a(n-13) -3432*a(n-15) +429*a(n-16) +2574*a(n-17) -572*a(n-18) -1430*a(n-19) +429*a(n-20) +572*a(n-21) -208*a(n-22) -156*a(n-23) +65*a(n-24) +26*a(n-25) -12*a(n-26) -2*a(n-27) +a(n-28)
%e A202097 Some solutions for n=2
%e A202097 ..1..1..1..1..0..0..0....1..1..1..1..0..0..0....1..1..1..1..1..1..1
%e A202097 ..1..1..0..1..0..1..0....1..1..1..1..1..0..0....1..1..0..1..0..1..0
%e A202097 ..0..1..0..1..0..0..0....1..1..1..1..0..0..0....1..0..1..0..1..0..1
%e A202097 ..1..0..0..0..0..0..0....1..1..0..0..0..0..0....1..1..0..1..0..0..0
%K A202097 nonn
%O A202097 1,1
%A A202097 _R. H. Hardin_ Dec 11 2011