A229590 Number of defective 3-colorings of a 5 X n 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.
0, 1152, 16416, 224532, 2865780, 35690460, 435326724, 5230362804, 62078234652, 729497509476, 8501915068020, 98397780931572, 1132075322344044, 12958123181386308, 147663327988334916, 1676107610928542292
Offset: 1
Keywords
Examples
Some solutions for n=3: 0 1 0 0 1 0 0 1 0 0 1 2 0 1 2 0 1 0 0 1 2 0 2 0 2 1 1 1 2 0 0 1 0 0 1 0 0 1 2 2 0 1 0 2 0 2 0 2 0 2 0 1 2 1 0 1 0 2 1 1 1 2 0 0 2 1 2 0 1 1 2 0 1 0 2 0 2 0 2 0 1 1 2 0 2 0 2 1 2 1 1 2 1 2 0 2 1 0 2 1 0 1 2 1 2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A229586.
Formula
Empirical: a(n) = 32*a(n-1) - 384*a(n-2) + 2200*a(n-3) - 6494*a(n-4) + 9016*a(n-5) - 816*a(n-6) - 14888*a(n-7) + 18879*a(n-8) - 5464*a(n-9) - 7472*a(n-10) + 8336*a(n-11) - 3648*a(n-12) + 768*a(n-13) - 64*a(n-14) for n > 18.
Comments