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.

A219143 Unchanging value maps: number of 2 X n binary arrays indicating the locations of corresponding elements unequal to no horizontal, diagonal or antidiagonal neighbor in a random 0..2 2 X n array.

Original entry on oeis.org

1, 6, 18, 39, 96, 225, 543, 1293, 3096, 7392, 17673, 42228, 100929, 241197, 576441, 1377606, 3292314, 7868187, 18803964, 44939013, 107398431, 256668285, 613403916, 1465955712, 3503443917, 8372776200, 20009848437, 47820940581, 114285841233
Offset: 1

Views

Author

R. H. Hardin, Nov 12 2012

Keywords

Comments

Row 2 of A219142.

Examples

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

Crossrefs

Cf. A219142.

Formula

Empirical: a(n) = 2*a(n-1) + a(n-2) - a(n-3) + 2*a(n-4) for n>5.
Empirical g.f.: x*(1 + 4*x + 5*x^2 - 2*x^3 + 4*x^4) / (1 - 2*x - x^2 + x^3 - 2*x^4). - Colin Barker, Mar 11 2018