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.

A232282 Number of 2 X n 0..2 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors.

Original entry on oeis.org

9, 35, 199, 1066, 6019, 32301, 174400, 944500, 5142177, 27937799, 151639871, 822991186, 4468833656, 24267873410, 131775553922, 715505284261, 3885076657421, 21095823631806, 114549994256771, 622001619001412
Offset: 1

Views

Author

R. H. Hardin, Nov 22 2013

Keywords

Comments

Row 2 of A232281.

Examples

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

Crossrefs

Cf. A232281.

Formula

Empirical: a(n) = 9*a(n-1) -23*a(n-2) +20*a(n-3) +81*a(n-4) -511*a(n-5) +294*a(n-6) +150*a(n-7) -168*a(n-8) +1692*a(n-9) +432*a(n-10).