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.

A228388 Number of nX6 binary arrays with top left value 1 and no two ones adjacent horizontally or vertically.

Original entry on oeis.org

8, 70, 963, 11449, 143072, 1755243, 21683149, 267157140, 3294926929, 40621769739, 500881862476, 6175719012200, 76146337618146, 938873253971283, 11576206633106083, 142733217148402101, 1759883977929944820
Offset: 1

Views

Author

R. H. Hardin Aug 21 2013

Keywords

Comments

Column 6 of A228390

Examples

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

Formula

Empirical: a(n) = 8*a(n-1) +62*a(n-2) -78*a(n-3) -375*a(n-4) +300*a(n-5) +486*a(n-6) -385*a(n-7) -30*a(n-8) +52*a(n-9) -2*a(n-10) -a(n-11)