A229679 Number of defective 3-colorings of an n X 2 0..2 array connected diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..2 order.
0, 2, 36, 360, 2688, 17280, 101376, 559104, 2949120, 15040512, 74711040, 363331584, 1736441856, 8178892800, 38050725888, 175154135040, 798863917056, 3614214979584, 16234976378880, 72464688218112, 321607151124480
Offset: 1
Keywords
Examples
Some solutions for n=3: ..0..1....0..1....0..1....0..0....0..1....0..0....0..1....0..1....0..1....0..1 ..1..1....1..2....1..0....1..0....1..1....0..1....2..0....1..2....2..2....1..1 ..1..2....2..2....2..2....1..1....0..1....2..0....2..2....0..1....2..2....2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Formula
Empirical: a(n) = 12*a(n-1) -48*a(n-2) +64*a(n-3) for n>5.
Empirical g.f.: 2*x^2 - 12*x^3*(3-6*x+8*x^2) / (4*x-1)^3. - R. J. Mathar, Sep 29 2013
Empirical: a(n) = 3*2^(2*n-5)*(3 - 5*n + 2*n^2) for n>2. - Colin Barker, Jun 13 2017
From Enrique Navarrete, Jul 08 2025: (Start)
The above empirical formulas are correct.
a(n) = 3*binomial(2*(n-1),2)*2^(2*n-5) for n >= 3.
a(n) = 3*A385601(2*(n-1)) for n >= 3. (End)