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.

A229589 Number of defective 3-colorings of a 4 X n 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.

Original entry on oeis.org

0, 224, 2160, 19764, 167364, 1375152, 11035044, 87040260, 677327004, 5213798784, 39777273072, 301217858676, 2266655495148, 16964398022220, 126372108661164, 937513290523896, 6929886363153768, 51058923535878660, 375112065125492964
Offset: 1

Views

Author

R. H. Hardin, Sep 26 2013

Keywords

Comments

Row 4 of A229586.

Examples

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

Crossrefs

Cf. A229586.

Formula

Empirical: a(n) = 18*a(n-1) - 111*a(n-2) + 282*a(n-3) - 333*a(n-4) + 180*a(n-5) - 36*a(n-6) for n > 12.