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.

A207566 Number of 5Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.

This page as a plain text file.
%I A207566 #7 Jul 22 2025 20:35:38
%S A207566 14,196,618,2135,9568,32823,106833,378104,1270366,4115246,13610961,
%T A207566 44612720,143811649,464834887,1499835880,4806097790,15381806724,
%U A207566 49183889079,156799893608,499134276207,1587530091239,5041841569010
%N A207566 Number of 5Xn 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 1 0 vertically.
%C A207566 Row 5 of A207564
%H A207566 R. H. Hardin, <a href="/A207566/b207566.txt">Table of n, a(n) for n = 1..210</a>
%F A207566 Empirical: a(n) = 5*a(n-1) -6*a(n-2) +22*a(n-3) -85*a(n-4) +35*a(n-5) -76*a(n-6) +424*a(n-7) +187*a(n-8) -47*a(n-9) -1134*a(n-10) -824*a(n-11) +5*a(n-12) +1715*a(n-13) +1238*a(n-14) +142*a(n-15) -1061*a(n-16) -707*a(n-17) -174*a(n-18) +280*a(n-19) +89*a(n-20) -13*a(n-21) -46*a(n-22) +10*a(n-23) +11*a(n-24) +11*a(n-25)
%e A207566 Some solutions for n=4
%e A207566 ..1..0..1..1....1..0..1..1....0..1..1..0....0..0..0..0....1..1..0..0
%e A207566 ..1..1..1..1....0..1..1..0....0..0..0..0....1..0..0..0....1..1..1..0
%e A207566 ..1..0..1..1....1..0..1..1....0..0..0..0....0..1..1..0....1..1..0..1
%e A207566 ..1..1..1..1....0..1..1..0....0..0..0..0....0..0..0..0....1..1..1..0
%e A207566 ..1..0..1..1....1..0..1..1....1..1..0..0....1..0..1..1....1..1..0..1
%K A207566 nonn
%O A207566 1,1
%A A207566 _R. H. Hardin_ Feb 18 2012