|
|
A252883
|
|
Number of (1+2)X(n+2) 0..2 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order
|
|
1
|
|
|
510, 3847, 28474, 211881, 1575377, 11720268, 87198323, 648799167, 4827612777, 35921934387, 267296715834, 1988972427035, 14800140113352, 110129393771043, 819485370061916, 6097885580453108, 45375088417906622, 337641430554410917
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 8*a(n-1) +20*a(n-2) -185*a(n-3) -122*a(n-4) +1143*a(n-5) +648*a(n-6) -1146*a(n-7) -3579*a(n-8) -11329*a(n-9) +5610*a(n-10) +46499*a(n-11) +12723*a(n-12) -51010*a(n-13) -23963*a(n-14) -86046*a(n-15) -67672*a(n-16) +201912*a(n-17) +206293*a(n-18) +29694*a(n-19) -172585*a(n-20) -239780*a(n-21) -25780*a(n-22) +111228*a(n-23) +97884*a(n-24) -1768*a(n-25) -49360*a(n-26) -9504*a(n-27) +2048*a(n-28) -256*a(n-29)
|
|
EXAMPLE
|
Some solutions for n=3
..0..1..2..1..1....0..0..1..2..1....0..1..0..0..1....0..1..0..2..2
..1..2..2..1..1....1..0..0..2..1....2..1..0..0..2....2..1..0..2..2
..0..1..2..1..2....1..0..1..1..2....0..2..1..1..2....0..2..1..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|