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.

A229632 Number of defective 3-colorings of an nX3 0..2 array connected horizontally, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.

Original entry on oeis.org

1, 40, 244, 1496, 8800, 50084, 277996, 1513104, 8106632, 42869740, 224232436, 1161920760, 5972173872, 30479422388, 154582269500, 779632820512, 3912450838808, 19545592617532, 97246103407556, 482032538140680
Offset: 1

Views

Author

R. H. Hardin, Sep 27 2013

Keywords

Comments

Column 3 of A229637

Examples

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

Formula

Empirical: a(n) = 15*a(n-1) -81*a(n-2) +185*a(n-3) -162*a(n-4) +60*a(n-5) -8*a(n-6) for n>7.
Empirical: g.f. x -4*x^2*(2*x-5)*(12*x^4-45*x^3+47*x^2-17*x+2) / (2*x^2-5*x+1)^3. - R. J. Mathar, Sep 29 2013