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.

A268737 Number of nX5 binary arrays with some 1 horizontally or vertically adjacent to some other 1 exactly once.

Original entry on oeis.org

10, 145, 1788, 19591, 200204, 1971414, 18847982, 176668038, 1629738420, 14851460143, 133983018272, 1198816726867, 10652116047394, 94092052069550, 826903484125628, 7234834159717064, 63053215344757166, 547626807437714177
Offset: 1

Views

Author

R. H. Hardin, Feb 12 2016

Keywords

Comments

Column 5 of A268740.

Examples

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

Crossrefs

Cf. A268740.

Formula

Empirical: a(n) = 8*a(n-1) +56*a(n-2) -288*a(n-3) -1506*a(n-4) +870*a(n-5) +7568*a(n-6) -1632*a(n-7) -15481*a(n-8) +4624*a(n-9) +13495*a(n-10) -6192*a(n-11) -4336*a(n-12) +2890*a(n-13) +82*a(n-14) -288*a(n-15) +24*a(n-16) +8*a(n-17) -a(n-18)