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.

A207738 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.

This page as a plain text file.
%I A207738 #7 Jul 22 2025 20:45:04
%S A207738 15,225,1425,10535,86355,733363,6349893,55343835,484078805,4239251331,
%T A207738 37149155225,325617022405,2854427890525,25023592056775,
%U A207738 219376652808375,1923245408892489,16860907224450661,147818180556775365
%N A207738 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 0 0 vertically.
%C A207738 Column 5 of A207741
%H A207738 R. H. Hardin, <a href="/A207738/b207738.txt">Table of n, a(n) for n = 1..210</a>
%F A207738 Empirical: a(n) = 12*a(n-1) -2*a(n-2) -307*a(n-3) +431*a(n-4) +2588*a(n-5) -3497*a(n-6) -10961*a(n-7) +10555*a(n-8) +24977*a(n-9) -14239*a(n-10) -30241*a(n-11) +8813*a(n-12) +19175*a(n-13) -2139*a(n-14) -6107*a(n-15) +82*a(n-16) +903*a(n-17) +13*a(n-18) -56*a(n-19) +a(n-21) for n>22
%e A207738 Some solutions for n=4
%e A207738 ..1..0..1..1..0....0..0..1..1..1....0..1..1..1..0....0..0..1..1..0
%e A207738 ..1..1..0..0..1....0..1..1..1..1....1..1..1..0..1....0..0..1..1..1
%e A207738 ..0..0..1..1..0....0..1..1..0..0....0..0..1..1..0....0..0..1..1..0
%e A207738 ..1..1..0..1..1....0..1..1..1..1....1..1..1..1..1....0..0..1..1..1
%K A207738 nonn
%O A207738 1,1
%A A207738 _R. H. Hardin_ Feb 19 2012