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.

A188707 Number of 3 X n binary arrays without the pattern 0 0 diagonally or vertically.

Original entry on oeis.org

5, 21, 90, 387, 1665, 7164, 30825, 132633, 570690, 2455551, 10565685, 45461772, 195611805, 841673709, 3621533130, 15582644523, 67048623225, 288495182556, 1241330043105, 5341164667857, 22981833209970, 98885672046279
Offset: 1

Views

Author

R. H. Hardin, Apr 08 2011

Keywords

Comments

Row 3 of A188706.

Examples

			Some solutions for 3 X 3:
  1 1 0    1 0 0    1 1 0    1 0 0    0 0 0    1 0 0    0 0 1
  1 1 1    1 1 1    1 0 1    1 1 1    1 1 1    1 1 1    1 1 1
  1 0 1    1 1 0    0 1 1    0 0 1    0 0 1    1 1 1    0 1 1
		

Programs

Formula

a(n) = 5*a(n-1) - 3*a(n-2).
a(n) = [1,1;1,4]^(n-1).{1,2}.{1,2}. - John M. Campbell, Jul 09 2011
G.f.: x*(5 - 4*x)/(1 - 5*x + 3*x^2). - Colin Barker, Mar 11 2012