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.

A203831 Number of (n+1)X5 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.

Original entry on oeis.org

5625, 151659, 4238721, 119606211, 3383285769, 95763046491, 2710984443345, 76749227497395, 2172829037910489, 61514609224652235, 1741531281545538081, 49304251065416837283, 1395845890054082693289, 39517602012270762571323
Offset: 1

Views

Author

R. H. Hardin Jan 06 2012

Keywords

Comments

Column 4 of A203835

Examples

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

Formula

Empirical: a(n) = 31*a(n-1) -24*a(n-2) -1612*a(n-3) +3816*a(n-4) +1152*a(n-5) -2784*a(n-6) +256*a(n-7)