|
|
A252977
|
|
Number of n X n nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 2 and every value increasing by 0 or 1 with every step right, diagonally se or down
|
|
1
|
|
|
0, 0, 1, 68, 4657, 432842, 60650883, 13458882036, 4857082197177, 2895119784219358, 2877300288177184239, 4796057029604523514392, 13457301734652492685623300, 63707500883584152928303777296
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..0..1....0..0..0..0....0..0..0..1....0..0..0..0....0..0..1..1
..0..0..0..1....0..0..0..1....1..1..1..1....0..0..0..0....0..0..1..1
..0..1..1..1....0..0..1..1....1..1..1..1....0..0..0..0....0..1..1..1
..1..1..1..1....1..1..1..1....1..1..1..1....1..1..1..1....1..1..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|