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.

A229603 Number of defective 3-colorings of an n X 5 0..2 array connected horizontally and vertically with exactly two mistakes, and colors introduced in row-major 0..2 order.

Original entry on oeis.org

12, 925, 20714, 362100, 5655616, 82613904, 1153135492, 15568071652, 204858459714, 2641246065146, 33490766408662, 418803158565406, 5175912161534684, 63325575352273052, 768005500079367536
Offset: 1

Views

Author

R. H. Hardin, Sep 26 2013

Keywords

Comments

Column 5 of A229606.

Examples

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

Crossrefs

Cf. A229606.

Formula

Empirical: a(n) = 47*a(n-1) - 915*a(n-2) + 9649*a(n-3) - 60959*a(n-4) + 242397*a(n-5) - 616481*a(n-6) + 977203*a(n-7) - 836412*a(n-8) + 41816*a(n-9) + 793688*a(n-10) - 1000320*a(n-11) + 656832*a(n-12) - 262080*a(n-13) + 63744*a(n-14) - 8704*a(n-15) + 512*a(n-16) for n > 17.