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.

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

This page as a plain text file.
%I A207706 #7 Jul 22 2025 20:42:06
%S A207706 10,100,390,1521,8151,43681,206910,980100,4863870,24137569,117661437,
%T A207706 573554601,2815061256,13816591936,67635405320,331090914025,
%U A207706 1622397552875,7950003180625,38941246190550,190744660149156,934456590661998
%N A207706 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.
%C A207706 Row 5 of A207703
%H A207706 R. H. Hardin, <a href="/A207706/b207706.txt">Table of n, a(n) for n = 1..210</a>
%F A207706 Empirical: a(n) = 3*a(n-1) +28*a(n-3) +106*a(n-4) -59*a(n-5) +7*a(n-6) -592*a(n-7) -1897*a(n-8) +226*a(n-9) -290*a(n-10) +3421*a(n-11) +10592*a(n-12) -320*a(n-13) +453*a(n-14) -7096*a(n-15) -21514*a(n-16) +149*a(n-17) +669*a(n-18) +5807*a(n-19) +16981*a(n-20) +326*a(n-21) -438*a(n-22) -1964*a(n-23) -5582*a(n-24) -245*a(n-25) +68*a(n-26) +256*a(n-27) +802*a(n-28) +41*a(n-29) -4*a(n-30) -11*a(n-31) -49*a(n-32) -2*a(n-33) +a(n-36)
%e A207706 Some solutions for n=4
%e A207706 ..1..1..1..1....1..1..0..0....0..0..1..1....1..1..1..0....0..0..1..1
%e A207706 ..1..1..0..0....1..1..1..0....0..1..1..0....0..1..1..0....0..0..1..1
%e A207706 ..1..1..1..1....1..1..1..0....0..0..1..1....1..1..1..0....0..0..1..1
%e A207706 ..1..1..0..0....1..1..1..0....0..0..1..1....1..1..1..0....0..0..1..1
%e A207706 ..1..1..0..1....1..1..1..0....0..0..1..1....1..1..1..0....0..0..1..1
%K A207706 nonn
%O A207706 1,1
%A A207706 _R. H. Hardin_ Feb 19 2012