|
|
A252830
|
|
Number of n X n nonnegative integer arrays with upper left 0 and every value within 2 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down
|
|
1
|
|
|
1, 5, 44, 493, 6068, 78674, 1056756, 14564701, 204666202, 2919462498, 42143180174, 614251526864, 9024782449736, 133489812361806, 1985873221687284, 29689739907869581, 445797648515664064, 6719243690952576928
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..1..2....0..0..1..1....0..0..1..1....0..0..1..1....0..0..0..1
..1..1..1..2....1..1..1..1....1..1..1..2....1..1..1..1....1..1..1..1
..1..1..2..2....1..1..1..1....1..1..1..2....1..2..2..2....1..1..1..1
..2..2..2..2....2..2..2..2....1..2..2..2....1..2..2..3....2..2..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|