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.

A208416 Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 0 1 1 vertically.

This page as a plain text file.
%I A208416 #7 Jun 09 2023 22:42:46
%S A208416 10,100,378,1269,3835,10098,26375,65178,157734,378262,891503,2096679,
%T A208416 4903388,11430925,26635182,61947132,144056682,334894773,778319859,
%U A208416 1809079118,4204482395,9772110046,22713444310,52793388462,122714964255
%N A208416 Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 0 and 0 1 1 vertically.
%C A208416 Column 4 of A208420.
%H A208416 R. H. Hardin, <a href="/A208416/b208416.txt">Table of n, a(n) for n = 1..210</a>
%F A208416 Empirical: a(n) = 4*a(n-1) -10*a(n-3) -15*a(n-4) +40*a(n-5) +19*a(n-6) -25*a(n-7) -60*a(n-8) +32*a(n-9) -10*a(n-10) +29*a(n-11) +28*a(n-12) +43*a(n-13) -83*a(n-14) -24*a(n-15) +4*a(n-16) +30*a(n-17) -13*a(n-18) +20*a(n-19) +a(n-20) -3*a(n-21) -8*a(n-22) +4*a(n-23) -2*a(n-24) -a(n-25) +a(n-27).
%e A208416 Some solutions for n=4
%e A208416 ..0..1..1..0....1..1..1..1....1..0..1..1....1..1..0..0....0..1..1..1
%e A208416 ..0..1..1..1....1..1..1..1....0..1..1..0....1..1..1..0....1..0..1..0
%e A208416 ..1..1..0..0....1..1..1..1....1..0..1..1....0..1..0..1....0..1..0..0
%e A208416 ..0..1..0..1....1..1..0..1....0..1..1..0....1..1..1..0....1..0..1..1
%Y A208416 Cf. A208420.
%K A208416 nonn
%O A208416 1,1
%A A208416 _R. H. Hardin_, Feb 26 2012