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.

A204072 Number of (n+1)X5 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..2 introduced in row major order.

Original entry on oeis.org

938, 25277, 706454, 19934369, 563880962, 15960507749, 451830740558, 12791537916233, 362138172985082, 10252434870775373, 290255213590923014, 8217375177569472881, 232640981675680448882, 6586267002045127095221
Offset: 1

Views

Author

R. H. Hardin Jan 10 2012

Keywords

Comments

Column 4 of A204076

Examples

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

Formula

Empirical: a(n) = 32*a(n-1) -55*a(n-2) -1588*a(n-3) +5428*a(n-4) -2664*a(n-5) -3936*a(n-6) +3040*a(n-7) -256*a(n-8)