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.

A208265 Number of n X 4 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 left-upward diagonal neighbors.

Original entry on oeis.org

8, 89, 1033, 11929, 137845, 1592731, 18403423, 212644499, 2457026181, 28390000737, 328035635669, 3790326714043, 43795780208895, 506043544208099, 5847140236199813, 67561476345437377, 780647102957445445
Offset: 1

Views

Author

R. H. Hardin, Feb 24 2012

Keywords

Comments

Column 4 of A208269.

Examples

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

Crossrefs

Cf. A208269.

Formula

Empirical: a(n) = 10*a(n-1) + 20*a(n-2) - 21*a(n-3) - 30*a(n-4) + 8*a(n-5).
Empirical g.f.: x*(8 + 9*x - 17*x^2 - 13*x^3 + 4*x^4) / (1 - 10*x - 20*x^2 + 21*x^3 + 30*x^4 - 8*x^5). - Colin Barker, Jun 29 2018