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.

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

Original entry on oeis.org

12, 488, 6031, 77620, 960325, 11485716, 133784624, 1525870912, 17108056051, 189113977298, 2065634425127, 22332806237194, 239326746885334, 2544956244990312, 26878587507519977, 282161860575964390
Offset: 1

Views

Author

R. H. Hardin, Sep 27 2013

Keywords

Comments

Column 5 of A229637.

Examples

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

Crossrefs

Cf. A229637.

Formula

Empirical: a(n) = 42*a(n-1) - 723*a(n-2) + 6569*a(n-3) - 33687*a(n-4) + 94839*a(n-5) - 116010*a(n-6) - 55215*a(n-7) + 305043*a(n-8) - 230994*a(n-9) - 118011*a(n-10) + 243513*a(n-11) - 84933*a(n-12) - 40719*a(n-13) + 42804*a(n-14) - 14887*a(n-15) + 2598*a(n-16) - 228*a(n-17) + 8*a(n-18) for n > 20.