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.

A297546 Number of 3Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 3 neighboring 1s.

Original entry on oeis.org

1, 4, 35, 93, 197, 905, 4617, 17190, 60751, 249752, 1059063, 4222592, 16594402, 66999457, 272610044, 1096920548, 4397739438, 17715067000, 71488573309, 287925302744, 1158665331861, 4666508501343, 18801789510992, 75728618048706
Offset: 1

Views

Author

R. H. Hardin, Dec 31 2017

Keywords

Comments

Row 3 of A297544.

Examples

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

Crossrefs

Cf. A297544.

Formula

Empirical: a(n) = 4*a(n-1) -4*a(n-2) +17*a(n-3) +22*a(n-4) -76*a(n-5) -55*a(n-6) -66*a(n-7) -151*a(n-8) +47*a(n-9) +101*a(n-10) -39*a(n-11) +43*a(n-12) +60*a(n-13) -21*a(n-14) +7*a(n-15) +2*a(n-16) +a(n-17)