|
|
A252931
|
|
Number of n X n nonnegative integer arrays with upper left 0 and every value within 3 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, 711, 17962, 578342, 21312696, 857248091, 36723156004, 1650365159314, 77015673357558, 3704833216794534, 182732875391479366, 9203662331845611018, 471886132793225715184, 24568007717042452684419, 1296265434331412271116602
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..1..1....0..0..1..1....0..0..1..1....0..0..1..1....0..0..1..1
..1..1..1..1....0..1..1..2....0..0..1..2....1..1..1..2....1..1..1..2
..1..1..1..1....0..1..2..2....0..1..1..2....2..2..2..2....2..2..2..2
..2..2..2..2....1..1..2..3....0..1..2..2....2..2..2..2....2..2..2..3
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|