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.

A208497 Number of nX4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 0 and 1 1 1 vertically.

This page as a plain text file.
%I A208497 #7 Jul 22 2025 21:23:43
%S A208497 10,100,144,324,650,1406,3024,6150,13560,28688,59598,128520,274230,
%T A208497 576520,1218560,2621232,5546520,11635076,24984990,53176014,111623072,
%U A208497 237955858,508611568,1072136960,2270141058,4856035380,10288291950
%N A208497 Number of nX4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 0 and 1 1 1 vertically.
%C A208497 Column 4 of A208501
%H A208497 R. H. Hardin, <a href="/A208497/b208497.txt">Table of n, a(n) for n = 1..210</a>
%F A208497 Empirical: a(n) = 12*a(n-3) +5*a(n-4) -57*a(n-6) -2*a(n-8) +139*a(n-9) -21*a(n-10) -8*a(n-11) -194*a(n-12) +61*a(n-13) -13*a(n-14) +178*a(n-15) -90*a(n-16) +18*a(n-17) -99*a(n-18) +48*a(n-19) +3*a(n-20) +40*a(n-21) -2*a(n-22) +a(n-23) -9*a(n-24) -2*a(n-25) +a(n-27) for n>29
%e A208497 Some solutions for n=4
%e A208497 ..0..1..1..1....0..1..0..0....1..1..1..0....1..0..1..1....1..0..1..0
%e A208497 ..1..0..1..0....0..1..1..1....0..1..0..1....1..0..1..1....1..0..1..1
%e A208497 ..1..1..0..0....1..0..1..1....1..0..1..1....0..1..0..0....0..1..0..1
%e A208497 ..0..1..0..1....1..1..0..0....1..1..1..0....1..1..1..1....0..1..0..0
%K A208497 nonn
%O A208497 1,1
%A A208497 _R. H. Hardin_ Feb 27 2012