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.

A208283 Number of n X 4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 0 vertically.

Original entry on oeis.org

10, 100, 378, 984, 2090, 3900, 6650, 10608, 16074, 23380, 32890, 45000, 60138, 78764, 101370, 128480, 160650, 198468, 242554, 293560, 352170, 419100, 495098, 580944, 677450, 785460, 905850, 1039528, 1187434, 1350540, 1529850, 1726400, 1941258
Offset: 1

Views

Author

R. H. Hardin, Feb 25 2012

Keywords

Comments

Column 4 of A208287.

Examples

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

Crossrefs

Cf. A208287.

Formula

Empirical: a(n) = (4/3)*n^4 + 10*n^3 + (2/3)*n^2 - 2*n.
Conjectures from Colin Barker, Jun 29 2018: (Start)
G.f.: 2*x*(5 + 25*x - 11*x^2 - 3*x^3) / (1 - x)^5.
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>5.
(End)