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.

A209103 Number of 4 X n 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors.

Original entry on oeis.org

14, 612, 23248, 849548, 30836932, 1118366188, 40556341276, 1470727552508, 53334292149524, 1934110124219172, 70138417396144324, 2543494195954824748, 92237079873229771996, 3344878451059254299004, 121298417878736991992724
Offset: 1

Views

Author

R. H. Hardin, Mar 05 2012

Keywords

Comments

Row 4 of A209100.

Examples

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

Crossrefs

Cf. A209100.

Formula

Empirical: a(n) = 61*a(n-1) -1124*a(n-2) +9139*a(n-3) -34187*a(n-4) +44684*a(n-5) +35628*a(n-6) -128720*a(n-7) +102352*a(n-8) -44832*a(n-9) +17472*a(n-10) for n>12.