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.

A297797 Number of nX3 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 5 neighboring 1s.

Original entry on oeis.org

1, 11, 37, 108, 533, 2434, 10287, 45968, 207906, 927565, 4149639, 18631844, 83542062, 374482908, 1679592819, 7532686680, 33779595704, 151490828968, 679394507158, 3046851336221, 13664151868643, 61279503538129
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2018

Keywords

Comments

Column 3 of A297802.

Examples

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

Crossrefs

Cf. A297802.

Formula

Empirical: a(n) = 3*a(n-1) +46*a(n-3) -56*a(n-4) +43*a(n-5) -576*a(n-6) +284*a(n-7) -620*a(n-8) +1922*a(n-9) -364*a(n-10) +1288*a(n-11) +884*a(n-12) -496*a(n-13) +504*a(n-14) -352*a(n-15)