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.

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

Original entry on oeis.org

12, 144, 720, 2400, 6300, 14112, 28224, 51840, 89100, 145200, 226512, 340704, 496860, 705600, 979200, 1331712, 1779084, 2339280, 3032400, 3880800, 4909212, 6144864, 7617600, 9360000, 11407500, 13798512, 16574544, 19780320, 23463900
Offset: 1

Views

Author

R. H. Hardin, Feb 23 2012

Keywords

Comments

Column 5 of A208142.

Examples

			Some solutions for n=4:
..0..0..0..0..0....0..0..0..0..0....1..1..1..0..0....1..0..1..0..1
..1..1..1..0..1....0..1..0..1..0....1..1..0..1..0....0..1..0..1..0
..1..0..1..0..0....0..1..0..0..0....0..1..0..1..0....0..1..0..1..0
..1..0..0..0..0....0..1..0..0..0....0..0..0..0..0....0..0..0..0..0
		

Crossrefs

Cf. A208142.

Formula

Empirical: a(n) = n^5 + 4*n^4 + 5*n^3 + 2*n^2.
Conjectures from Colin Barker, Jun 28 2018: (Start)
G.f.: 12*x*(1 + 6*x + 3*x^2) / (1 - x)^6.
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6) for n>6.
(End)