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.

A207456 Number of 5 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically.

Original entry on oeis.org

10, 100, 270, 1450, 5200, 23530, 92610, 396100, 1610950, 6754210, 27799200, 115710130, 478341370, 1985702500, 8222193630, 34098329530, 141276194800, 585672013210, 2427100765650, 10060368444100, 41694947333590
Offset: 1

Views

Author

R. H. Hardin, Feb 17 2012

Keywords

Comments

Row 5 of A207453.

Examples

			Some solutions for n=5:
  1 1 1 1 1     1 0 1 1 0     0 1 0 1 0     0 1 0 1 0
  1 1 1 1 1     1 1 0 1 1     1 1 0 1 0     1 1 0 1 0
  0 1 0 1 1     0 1 0 1 0     1 1 0 1 0     0 1 0 1 0
  0 1 0 1 0     0 1 0 1 0     1 1 0 1 0     0 1 0 1 0
  0 1 0 1 0     0 1 0 1 0     1 1 0 1 0     0 1 0 1 0
		

Crossrefs

Cf. A207453.

Formula

Empirical: a(n) = a(n-1) + 13*a(n-2) + 4*a(n-3) - 16*a(n-4).
Empirical g.f.: 10*x*(1 + 9*x + 4*x^2 - 16*x^3) / (1 - x - 13*x^2 - 4*x^3 + 16*x^4). - Colin Barker, Jun 23 2018