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.

A207122 Number of n X 7 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 0 1 1 vertically.

This page as a plain text file.
%I A207122 #7 Sep 07 2022 16:13:11
%S A207122 31,961,6634,45796,186822,762129,2330037,7123561,18090482,45941284,
%T A207122 102402024,228251664,461670264,933791364,1751615118,3285697041,
%U A207122 5802776793,10248120289,17226819610,28957828900,46710814150,75347505025
%N A207122 Number of n X 7 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 0 1 and 0 1 1 vertically.
%C A207122 Column 7 of A207123.
%H A207122 R. H. Hardin, <a href="/A207122/b207122.txt">Table of n, a(n) for n = 1..210</a>
%F A207122 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 A207122 Some solutions for n=4
%e A207122 ..1..1..1..0..0..0..0....1..0..1..1..0..0..0....0..1..1..0..0..0..0
%e A207122 ..0..1..1..1..0..0..0....0..0..0..0..0..0..0....1..1..1..1..0..0..0
%e A207122 ..1..0..0..0..0..0..0....1..0..0..0..0..0..0....0..0..0..0..0..0..0
%e A207122 ..0..1..1..0..0..0..0....0..0..0..0..0..0..0....1..0..1..1..0..0..0
%Y A207122 Cf. A207123.
%K A207122 nonn
%O A207122 1,1
%A A207122 _R. H. Hardin_, Feb 15 2012