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.

A283567 Number of nX3 0..1 arrays with no 1 equal to more than one of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly one element.

Original entry on oeis.org

1, 26, 169, 1108, 6453, 36038, 194173, 1021432, 5275885, 26869458, 135310457, 675163708, 3343196861, 16447661790, 80470971869, 391822686752, 1899839181365, 9177752354378, 44190339947417, 212148874972196, 1015791721800101
Offset: 1

Views

Author

R. H. Hardin, Mar 11 2017

Keywords

Comments

Column 3 of A283572.

Examples

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

Crossrefs

Cf. A283572.

Formula

Empirical: a(n) = 10*a(n-1) -27*a(n-2) -4*a(n-3) +89*a(n-4) -106*a(n-5) -85*a(n-6) +228*a(n-7) -60*a(n-8) -192*a(n-9) +144*a(n-10) +64*a(n-11) -64*a(n-12)