|
|
A253031
|
|
Number of (n+2)X(3+2) 0..2 arrays with every consecutive three elements in every row and column having exactly two distinct values, and new values 0 upwards introduced in row major order
|
|
1
|
|
|
9126, 102060, 1134864, 12647772, 141199416, 1576282464, 17600380920, 196546814928, 2194907186304, 24511818033072, 273740816863008, 3057065649201024, 34140581558811360, 381274270682513472
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 12*a(n-1) +8*a(n-2) -96*a(n-3) -1220*a(n-4) +332*a(n-5) +12548*a(n-6) +11360*a(n-7) -41384*a(n-8) -112608*a(n-9) +7728*a(n-10) +341792*a(n-11) +337408*a(n-12) -210560*a(n-13) -870400*a(n-14) -1209856*a(n-15) +668672*a(n-16) +2822144*a(n-17) +458752*a(n-18) -1933312*a(n-19) -851968*a(n-20)
|
|
EXAMPLE
|
Some solutions for n=2
..0..1..1..2..1....0..1..1..2..2....0..1..1..2..2....0..0..1..0..0
..1..1..0..0..2....0..0..2..0..0....2..2..0..0..2....0..1..1..0..1
..0..2..0..0..1....1..0..1..0..0....2..1..1..2..1....2..0..2..2..0
..1..2..2..1..2....1..2..1..1..2....0..1..0..0..1....0..1..1..2..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|