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.

A202796 Number of n X 2 binary arrays with every one adjacent to another one horizontally or vertically.

This page as a plain text file.
%I A202796 #13 Feb 20 2018 07:19:33
%S A202796 2,10,36,126,454,1632,5854,21010,75412,270662,971438,3486624,12513958,
%T A202796 44914250,161203204,578579694,2076599286,7453190368,26750489166,
%U A202796 96011055010,344596415668,1236802258678,4439047411742,15932330156576
%N A202796 Number of n X 2 binary arrays with every one adjacent to another one horizontally or vertically.
%C A202796 Column 2 of A202802.
%H A202796 R. H. Hardin, <a href="/A202796/b202796.txt">Table of n, a(n) for n = 1..210</a>
%F A202796 Empirical: a(n) = 3*a(n-1) + a(n-2) + 4*a(n-3).
%F A202796 Empirical g.f.: 2*x*(1 + 2*x + 2*x^2) / (1 - 3*x - x^2 - 4*x^3). - _Colin Barker_, Feb 20 2018
%e A202796 Some solutions for n=5:
%e A202796 ..0..1....0..0....0..1....1..0....0..0....1..0....1..1....0..1....0..1....1..0
%e A202796 ..0..1....1..0....1..1....1..0....0..0....1..0....1..1....1..1....1..1....1..1
%e A202796 ..1..1....1..1....1..1....1..1....0..1....0..0....1..0....0..0....1..0....0..1
%e A202796 ..1..1....0..1....1..0....1..0....0..1....0..1....0..1....1..0....0..0....1..0
%e A202796 ..1..0....1..1....1..0....1..0....0..0....0..1....1..1....1..1....0..0....1..0
%Y A202796 Cf. A202802.
%K A202796 nonn
%O A202796 1,1
%A A202796 _R. H. Hardin_, Dec 24 2011