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.

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

Original entry on oeis.org

8, 81, 853, 9075, 96831, 1034073, 11045757, 117997043, 1260537911, 13466147569, 143857201093, 1536809621307, 16417559602831, 175386899980873, 1873638094198285, 20015860487662275, 213827138093982759
Offset: 1

Views

Author

R. H. Hardin, Feb 22 2012

Keywords

Comments

Column 5 of A207997.

Examples

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

Formula

a(n) = 16*a(n-1) -65*a(n-2) +92*a(n-3) -48*a(n-4) +8*a(n-5).
G.f.: -x*(8-47*x+77*x^2-44*x^3+8*x^4) / ( -1+16*x-65*x^2+92*x^3-48*x^4+8*x^5 ). - R. J. Mathar, Nov 23 2015