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.

A229604 Number of defective 3-colorings of an n X 6 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

40, 3924, 131345, 3476928, 82613904, 1840258874, 39229935270, 809714005005, 16301446350838, 321725691680589, 6247090415396847, 119665707667897987, 2265983192057928009, 42485559978048128856, 789743391503380249568
Offset: 1

Views

Author

R. H. Hardin, Sep 26 2013

Keywords

Comments

Column 6 of A229606.

Examples

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

Crossrefs

Cf. A229606.

Formula

Empirical: a(n) = 90*a(n-1) - 3573*a(n-2) + 83214*a(n-3) - 1278486*a(n-4) + 13836015*a(n-5) - 110021385*a(n-6) + 661896144*a(n-7) - 3076398702*a(n-8) + 11214272853*a(n-9) - 32398609896*a(n-10) + 74677395474*a(n-11) - 137758028106*a(n-12) + 203308881255*a(n-13) - 239066083215*a(n-14) + 222060410955*a(n-15) - 160604595216*a(n-16) + 88409012652*a(n-17) - 35729023024*a(n-18) + 9979813584*a(n-19) - 1718948736*a(n-20) + 137388096*a(n-21) for n > 23.