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.

A229531 Number of defective 3-colorings of an n X 5 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.

Original entry on oeis.org

16, 112, 1588, 19276, 221096, 2451728, 26566266, 283010776, 2975590424, 30959068528, 319352065652, 3270635802440, 33292532186562, 337120240897408, 3398161294369868, 34116704260522692, 341314436219045264
Offset: 1

Views

Author

R. H. Hardin, Sep 25 2013

Keywords

Comments

Column 5 of A229534.

Examples

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

Crossrefs

Cf. A229534.

Formula

Empirical: a(n) = 28*a(n-1) - 286*a(n-2) + 1290*a(n-3) - 2373*a(n-4) + 304*a(n-5) + 3551*a(n-6) - 2846*a(n-7) - 546*a(n-8) + 1308*a(n-9) - 505*a(n-10) + 76*a(n-11) - 4*a(n-12) for n > 13.