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.

A219412 Unmatched value maps: number of 3 X n binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..2 3 X n array.

Original entry on oeis.org

1, 21, 181, 1199, 8173, 57097, 398375, 2773933, 19314785, 134507787, 936720513, 6523315045, 45428247915, 316361693953, 2203138855813, 15342630706087, 106845881585421, 744073337324881, 5181717103636911, 36085410931557557
Offset: 1

Views

Author

R. H. Hardin, Nov 19 2012

Keywords

Comments

Row 3 of A219410.

Examples

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

Crossrefs

Cf. A219410.

Formula

Empirical: a(n) = 8*a(n-1) -14*a(n-2) +52*a(n-3) -48*a(n-4) +110*a(n-5) -51*a(n-6) +60*a(n-7) +52*a(n-8) -120*a(n-9) -20*a(n-10) +32*a(n-11).