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.

A198712 Number of nX5 0..3 arrays with values 0..3 introduced in row major order and no element equal to any horizontal or vertical neighbor.

Original entry on oeis.org

14, 1201, 107042, 9548295, 851787199, 75987485516, 6778819400772, 604736581320925, 53948385378521909, 4812720805166620356, 429341516830025751982, 38301440209010857426775, 3416861087749979581617789
Offset: 1

Views

Author

R. H. Hardin Oct 29 2011

Keywords

Comments

Column 5 of A198715

Examples

			Some solutions with all values from 0 to 3 for n=4
..0..1..2..0..2....0..1..2..3..1....0..1..0..2..0....0..1..2..0..1
..1..0..3..2..3....1..0..3..1..0....1..0..1..0..1....1..0..1..2..3
..0..1..2..3..1....0..1..2..3..2....0..1..2..1..3....0..1..0..3..1
..1..3..0..2..3....1..2..1..2..1....1..3..0..3..2....1..0..2..1..0
		

Formula

Empirical: a(n) = 119*a(n-1) -2929*a(n-2) +25066*a(n-3) -76115*a(n-4) -887*a(n-5) +324153*a(n-6) -444798*a(n-7) +175392*a(n-8)