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.

A207958 Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 0 vertically.

This page as a plain text file.
%I A207958 #7 Jul 22 2025 21:03:34
%S A207958 19,361,1799,9994,66089,454223,3256420,23710041,175056303,1302289708,
%T A207958 9745464669,73203597153,551383463124,4160799992187,31438884544745,
%U A207958 237763980708800,1799270658075065,13621788512549441,103157746749440626
%N A207958 Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 0 0 vertically.
%C A207958 Column 6 of A207960
%H A207958 R. H. Hardin, <a href="/A207958/b207958.txt">Table of n, a(n) for n = 1..210</a>
%F A207958 Empirical: a(n) = 13*a(n-1) +9*a(n-2) -658*a(n-3) +1039*a(n-4) +14329*a(n-5) -34326*a(n-6) -176384*a(n-7) +511946*a(n-8) +1352737*a(n-9) -4558771*a(n-10) -6689551*a(n-11) +26573523*a(n-12) +21113342*a(n-13) -105695573*a(n-14) -38971355*a(n-15) +292721155*a(n-16) +24792595*a(n-17) -569902328*a(n-18) +62431986*a(n-19) +783137700*a(n-20) -190822601*a(n-21) -760200113*a(n-22) +256073871*a(n-23) +520017924*a(n-24) -209448271*a(n-25) -248794182*a(n-26) +112442437*a(n-27) +81922234*a(n-28) -40410236*a(n-29) -18013144*a(n-30) +9648914*a(n-31) +2504596*a(n-32) -1481312*a(n-33) -198888*a(n-34) +136672*a(n-35) +7264*a(n-36) -6656*a(n-37) -64*a(n-38) +128*a(n-39) for n>40
%e A207958 Some solutions for n=4
%e A207958 ..0..1..1..1..0..0....1..0..0..1..1..1....1..1..1..1..1..0....0..0..1..0..0..1
%e A207958 ..1..1..1..0..0..1....1..1..1..1..1..1....1..0..0..1..1..1....1..1..1..1..1..1
%e A207958 ..1..0..0..1..0..0....0..0..1..1..1..1....0..1..1..0..0..1....1..0..0..1..1..1
%e A207958 ..1..1..1..0..0..1....1..1..1..1..1..1....1..1..1..1..1..1....1..1..1..0..0..1
%K A207958 nonn
%O A207958 1,1
%A A207958 _R. H. Hardin_ Feb 21 2012