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.

A208706 Number of n X 5 0..1 arrays with new values 0..1 introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors.

Original entry on oeis.org

16, 356, 8128, 185344, 4226368, 96373248, 2197585152, 50111214592, 1142678737920, 26056337063936, 594158864306176, 13548518165364736, 308944889161203712, 7044825373067575296, 160642128347753938944
Offset: 1

Views

Author

R. H. Hardin, Mar 01 2012

Keywords

Comments

Column 5 of A208709.

Examples

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

Crossrefs

Cf. A208709.

Formula

Empirical: a(n) = 24*a(n-1) - 28*a(n-2) + 16*a(n-3) for n>4.
Empirical g.f.: 4*x*(4 - 7*x + 8*x^2 - 4*x^3) / (1 - 24*x + 28*x^2 - 16*x^3). - Colin Barker, Jul 06 2018