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.

A208047 Number of nX5 0..3 arrays with new values 0..3 introduced in row major order and no element equal to any horizontal, vertical or antidiagonal neighbor (colorings ignoring permutations of colors).

Original entry on oeis.org

14, 128, 1356, 14976, 168096, 1897888, 21472544, 243113056, 2753187616, 31181409632, 353155643424, 3999817236576, 45301793546528, 513087070702432, 5811214258319904, 65817707844947552, 745450199930022688
Offset: 1

Views

Author

R. H. Hardin Feb 22 2012

Keywords

Comments

Column 5 of A208050

Examples

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

Formula

Empirical: a(n) = 22*a(n-1) -177*a(n-2) +832*a(n-3) -2664*a(n-4) +5408*a(n-5) -4544*a(n-6) -7936*a(n-7) +24064*a(n-8) -16384*a(n-9) for n>10