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.

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

This page as a plain text file.
%I A207370 #7 Jul 22 2025 20:21:11
%S A207370 12,144,420,1736,5856,15525,45738,115368,287174,700960,1620770,
%T A207370 3730344,8345010,18340994,39838311,85088956,179931750,376333104,
%U A207370 779411136,1601416922,3263854675,6606700688,13288445988,26569986742,52845438100
%N A207370 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 0 1 1 vertically.
%C A207370 Row 5 of A207368
%H A207370 R. H. Hardin, <a href="/A207370/b207370.txt">Table of n, a(n) for n = 1..210</a>
%F A207370 Empirical: a(n) = 5*a(n-1) -3*a(n-2) -14*a(n-3) -7*a(n-4) +68*a(n-5) +9*a(n-6) -97*a(n-7) -119*a(n-8) +156*a(n-9) +124*a(n-10) +29*a(n-11) -161*a(n-12) -6*a(n-13) -164*a(n-14) +73*a(n-15) +79*a(n-16) +216*a(n-17) -118*a(n-18) +9*a(n-19) -127*a(n-20) +16*a(n-21) -64*a(n-22) +107*a(n-23) -11*a(n-24) +34*a(n-25) -30*a(n-26) +13*a(n-27) -26*a(n-28) +9*a(n-29) -3*a(n-30) +5*a(n-31) -2*a(n-32) +2*a(n-33) -a(n-34)
%e A207370 Some solutions for n=4
%e A207370 ..1..0..1..0....1..1..1..0....1..1..0..0....0..1..0..1....0..0..1..0
%e A207370 ..0..0..1..0....0..0..1..0....1..1..1..0....0..1..0..0....1..1..0..1
%e A207370 ..1..0..1..0....1..1..1..0....0..1..0..0....0..1..0..1....0..0..1..0
%e A207370 ..0..0..1..0....0..0..1..0....1..1..1..0....0..1..0..0....0..1..0..0
%e A207370 ..0..0..1..0....1..0..1..0....0..1..0..0....0..1..0..0....0..0..1..0
%K A207370 nonn
%O A207370 1,1
%A A207370 _R. H. Hardin_ Feb 17 2012