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.

A297311 Number of nX5 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 1 or 2 neighboring 1s.

Original entry on oeis.org

12, 207, 2577, 35476, 484808, 6623719, 90535227, 1237278512, 16909630099, 231098841942, 3158359335337, 43164380571143, 589914903106589, 8062194454707849, 110183650123040906, 1505847685192695964
Offset: 1

Views

Author

R. H. Hardin, Dec 28 2017

Keywords

Comments

Column 5 of A297314.

Examples

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

Crossrefs

Cf. A297314.

Formula

Empirical: a(n) = 6*a(n-1) +91*a(n-2) +215*a(n-3) -317*a(n-4) -733*a(n-5) +1104*a(n-6) -40*a(n-7) -1643*a(n-8) +1667*a(n-9) -589*a(n-10) +69*a(n-11) -a(n-12) for n>14