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.

A231834 Number of nX3 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.

Original entry on oeis.org

16, 188, 4508, 111621, 2836554, 71178861, 1792092360, 45099279326, 1134900171250, 28560684486812, 718739864735561, 18087411635523189, 455177754069590473, 11454748470680974894, 288263810554257272575
Offset: 1

Views

Author

R. H. Hardin, Nov 14 2013

Keywords

Comments

Column 3 of A231839

Examples

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

Formula

Empirical: a(n) = 16*a(n-1) +206*a(n-2) +762*a(n-3) -3181*a(n-4) -9838*a(n-5) +4473*a(n-6) +18193*a(n-7) +2848*a(n-8) -6404*a(n-9) -1848*a(n-10) for n>11