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.

A207929 Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 1 1 vertically.

This page as a plain text file.
%I A207929 #9 Jun 26 2018 06:09:29
%S A207929 6,36,72,144,360,900,2160,5184,12528,30276,73080,176400,425880,
%T A207929 1028196,2482272,5992704,14467680,34928100,84323880,203575824,
%U A207929 491475528,1186526916,2864529360,6915585600,16695700560,40306986756,97309674072
%N A207929 Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 1 1 vertically.
%C A207929 Row 3 of A207928.
%H A207929 R. H. Hardin, <a href="/A207929/b207929.txt">Table of n, a(n) for n = 1..210</a>
%F A207929 Empirical: a(n) = 2*a(n-1) + 2*a(n-3) + a(n-4) for n>5.
%F A207929 Empirical g.f.: 6*x*(1 + 4*x - 2*x^3 - x^4) / ((1 + x^2)*(1 - 2*x - x^2)). - _Colin Barker_, Jun 26 2018
%e A207929 Some solutions for n=10:
%e A207929 ..1..1..0..1..1..1..0..1..1..0....1..0..1..1..0..1..1..1..1..1
%e A207929 ..0..0..1..1..0..0..1..1..0..0....1..0..0..1..1..0..1..1..0..0
%e A207929 ..0..1..1..0..1..1..1..0..0..1....0..1..1..0..1..1..0..0..1..1
%Y A207929 Cf. A207928.
%K A207929 nonn
%O A207929 1,1
%A A207929 _R. H. Hardin_, Feb 21 2012