|
|
A229458
|
|
Number of defective 3-colorings of an n X 7 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order.
|
|
1
|
|
|
96, 4212, 145932, 4651079, 141595454, 4182294415, 120864516084, 3435347473308, 96375081239102, 2675316057467887, 73622425908369218, 2011331511818175847, 54609997468407739822, 1474865683738453492784, 39648575070681785006026
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 110*a(n-1) - 5243*a(n-2) + 144650*a(n-3) - 2610593*a(n-4) + 33017408*a(n-5) - 305811128*a(n-6) + 2137462184*a(n-7) - 11513372884*a(n-8) + 48502300256*a(n-9) - 161412354008*a(n-10) + 427044616576*a(n-11) - 901108804624*a(n-12) + 1517344261024*a(n-13) - 2035022988048*a(n-14) + 2164824966496*a(n-15) - 1815145078160*a(n-16) + 1189730382208*a(n-17) - 603502277248*a(n-18) + 234173991424*a(n-19) - 68574152448*a(n-20) + 14906358784*a(n-21) - 2352277504*a(n-22) + 260550656*a(n-23) - 19140608*a(n-24) + 835584*a(n-25) - 16384*a(n-26).
|
|
EXAMPLE
|
Some solutions for n=3:
0 1 0 1 2 0 2 0 1 0 2 1 0 1 0 1 1 0 2 0 1
1 2 1 2 1 2 1 1 2 1 0 0 1 0 1 2 0 1 0 1 2
0 0 2 1 2 0 2 2 1 0 1 2 0 2 2 0 1 2 1 2 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|