|
|
A252999
|
|
Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 3 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
|
|
|
0, 0, 0, 1, 34, 279, 1028, 2601, 5318, 9499, 15464, 23533, 34026, 47263, 63564, 83249, 106638, 134051, 165808, 202229, 243634, 290343, 342676, 400953, 465494, 536619, 614648, 699901, 792698, 893359, 1002204, 1119553, 1245726, 1381043, 1525824
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = (160/3)*n^3 - 708*n^2 + (9539/3)*n - 4831 for n>4.
G.f.: x^4*(1 + 30*x + 149*x^2 + 112*x^3 + 28*x^4) / (1 - x)^4.
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>8.
(End)
|
|
EXAMPLE
|
Some solutions for n=6:
..0..0..0....0..1..1....0..1..2....0..0..1....0..0..1....0..0..1....0..1..1
..0..0..1....1..1..2....1..1..2....0..1..1....0..1..1....1..1..1....1..1..2
..0..0..1....1..2..2....1..1..2....0..1..2....1..1..1....1..1..1....1..1..2
..1..1..1....2..2..2....1..2..2....1..1..2....1..1..2....1..1..2....1..1..2
..1..1..2....2..2..2....1..2..2....1..2..2....2..2..2....1..2..2....1..2..2
..2..2..2....2..2..2....2..2..2....2..2..2....2..2..2....2..2..2....2..2..2
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|