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.

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

Original entry on oeis.org

40, 5077, 230383, 8186713, 258006388, 7551515197, 210095323918, 5632122625852, 146747625919741, 3738362679893995, 93505337317628617, 2303524911169269100, 56025377123719298929, 1347778566401139093298, 32117071054579505478784
Offset: 1

Views

Author

R. H. Hardin, Sep 27 2013

Keywords

Comments

Column 6 of A229694.

Examples

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

Formula

Empirical: a(n) = 75*a(n-1) - 2145*a(n-2) + 29368*a(n-3) - 205200*a(n-4) + 803115*a(n-5) - 1842183*a(n-6) + 2460375*a(n-7) - 1771470*a(n-8) + 531441*a(n-9) for n > 11.