|
|
A252888
|
|
Number of n X n nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 1 and every value increasing by 0 or 1 with every step right, diagonally se or down
|
|
1
|
|
|
0, 1, 18, 386, 12200, 608993, 49489706, 6648891794, 1489334202216, 558938851118771, 352470525557050186, 374131713336300308700, 669158287926101914730400, 2017974751792892883550074600
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..1..1....0..0..0..0....0..0..0..1....0..0..0..0....0..0..0..0
..0..0..1..2....0..0..1..1....0..1..1..1....0..0..1..1....0..0..0..1
..0..1..1..2....1..1..1..1....1..1..1..2....0..1..1..2....0..0..1..1
..1..1..2..2....1..1..2..2....1..2..2..2....0..1..2..2....0..1..1..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|