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.

A198903 Number of n X 5 0..4 arrays with values 0..4 introduced in row major order and no element equal to any horizontal or vertical neighbor.

Original entry on oeis.org

15, 4801, 2125425, 948656912, 423503301834, 189062985604305, 84402688527136201, 37679579867128064832, 16821155393975907014458, 7509406150309683843851949, 3352396396661126098060061297
Offset: 1

Views

Author

R. H. Hardin Oct 31 2011

Keywords

Comments

Column 5 of A198906.

Examples

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

Crossrefs

Cf. A198906.

Formula

Empirical: a(n) = 559*a(n-1) -54943*a(n-2) +2182857*a(n-3) -41132051*a(n-4) +348302393*a(n-5) -519526889*a(n-6) -11351340633*a(n-7) +79466721924*a(n-8) -227367989480*a(n-9) +329414183656*a(n-10) -247117199296*a(n-11) +89130224384*a(n-12) -11964372480*a(n-13).