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.

A241323 Number of nX2 0..3 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..3 introduced in row major order.

Original entry on oeis.org

1, 8, 85, 1030, 13011, 165924, 2121033, 27129985, 347071157, 4440219758, 56806066313, 726751710350, 9297746189765, 118951351657555, 1521812314158867, 19469410910818078, 249083253366686135, 3186663809907191548
Offset: 1

Views

Author

R. H. Hardin, Apr 19 2014

Keywords

Comments

Column 2 of A241328

Examples

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

Formula

Empirical: a(n) = 17*a(n-1) -57*a(n-2) +43*a(n-3) -37*a(n-4) +109*a(n-5) -62*a(n-6) -48*a(n-8) +36*a(n-9) for n>10