|
| |
|
|
A293616
|
|
Array of generalized Eulerian number triangles read by ascending antidiagonals, with m >= 0, n >= 0 and 0 <= k <= n.
|
|
3
|
|
|
|
1, 1, 0, 1, 1, 0, 1, 3, 0, 0, 1, 6, 0, 1, 0, 1, 10, 0, 7, 1, 0, 1, 15, 0, 25, 4, 0, 0, 1, 21, 0, 65, 10, 0, 1, 0, 1, 28, 0, 140, 20, 0, 15, 4, 0, 1, 36, 0, 266, 35, 0, 90, 30, 1, 0, 1, 45, 0, 462, 56, 0, 350, 120, 5, 0, 0, 1, 55, 0, 750, 84, 0, 1050, 350, 15, 0, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,8
|
|
|
LINKS
|
|
|
|
FORMULA
|
T(m, n, k) = (k + m)*T(m, n-1, k) + (n - k)*T(m, n-1, k-1) + T(m-1, n, k) with boundary conditions T(0, n, k) = 0^n; T(m, n, k) = 0 if k < 0 or k > n; and T(m, 0, k) = 0^k.
Let h(m, n) = x^(-m)*(1 - x)^(n + m)*PolyLog(-n - m, m, x) and p(m, n) the polynomial given by the expansion of h(m, n) after replacing log(1 - x) by 0. Then T(m, n, k) is the k-th coefficient of p(m, n) for 0 <= k < n.
|
|
|
EXAMPLE
|
Array starts:
m\j| 0 1 2 3 4 5 6 7 8 9 10 11 12
---|----------------------------------------------------------------------------
m=0| 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...
m=1| 1, 1, 0, 1, 1, 0, 1, 4, 1, 0, 1, 11, 11, ...
m=2| 1, 3, 0, 7, 4, 0, 15, 30, 5, 0, 31, 146, 91, ...
m=3| 1, 6, 0, 25, 10, 0, 90, 120, 15, 0, 301, 896, 406, ...
m=4| 1, 10, 0, 65, 20, 0, 350, 350, 35, 0, 1701, 3696, 1316, ...
m=5| 1, 15, 0, 140, 35, 0, 1050, 840, 70, 0, 6951, 11886, 3486, ...
m=6| 1, 21, 0, 266, 56, 0, 2646, 1764, 126, 0, 22827, 32172, 8022, ...
m=7| 1, 28, 0, 462, 84, 0, 5880, 3360, 210, 0, 63987, 76692, 16632, ...
m=8| 1, 36, 0, 750, 120, 0, 11880, 5940, 330, 0, 159027, 165792, 31812, ...
m=9| 1, 45, 0, 1155, 165, 0, 22275, 9900, 495, 0, 359502, 331617, 57057, ...
.
m\j| ... 13 14 15 16 17 18 19 20
---|----------------------------------------------------------------
m=0| ..., 0, 0, 0, 0, 0, 0, 0, 0, ... [A000007]
m=1| ..., 1, 0, 1, 26, 66, 26, 1, 0, ... [A173018]
m=2| ..., 6, 0, 63, 588, 868, 238, 7, 0, ... [A062253]
m=3| ..., 21, 0, 966, 5376, 5586, 1176, 28, 0, ... [A062254]
m=4| ..., 56, 0, 7770, 30660, 24570, 4200, 84, 0, ... [A062255]
m=5| ..., 126, 0, 42525, 129780, 84630, 12180, 210, 0, ...
m=6| ..., 252, 0, 179487, 446292, 245322, 30492, 462, 0, ...
m=7| ..., 462, 0, 627396, 1315776, 625086, 68376, 924, 0, ...
m=8| ..., 792, 0, 1899612, 3444012, 1440582, 140712, 1716, 0, ...
m=9| ..., 1287, 0, 5135130, 8198190, 3063060, 270270, 3003, 0, ...
.
The parameter m runs over the triangles and j indexes the triangles by reading them by rows. Let T(m, n) denote the row [T(m, n, k) for 0 <= k <= n] and T(m) denote the triangle [T(m, n) for n >= 0]. Then for instance T(2) is the triangle A062253, T(4, 2) is row 2 of A062255 (which is [65, 20, 0]) and T(4, 2, 1) = 20.
|
|
|
MAPLE
|
A293616 := proc(m, n, k) option remember:
if m = 0 then m^n elif k < 0 or k > n then 0 elif n = 0 then 1 else
for m in [$0..4] do for n in [$0..6] do print(seq(A293616(m, n, k), k=0..n)) od od;
# Sample uses:
# Flatten:
a := proc(n) local w; w := proc(k) local t, s; t := 1; s := 1;
while t <= k do s := s + 1; t := t + s od; [s - 1, s - t + k] end:
seq(A293616(n - k, w(k)[1], w(k)[2]), k=0..n) end: seq(a(n), n = 0..11);
|
|
|
MATHEMATICA
|
GenEulerianRow[0, n_] := Table[If[n==0 && j==0, 1, 0], {j, 0, n}];
GenEulerianRow[m_, n_] := If[n==0, {1}, Join[CoefficientList[x^(-m) (1 - x)^(n+m)
PolyLog[-n-m, m, x] /. Log[1-x] -> 0, x], {0}]];
(* Sample use: *)
A173018Row[n_] := GenEulerianRow[1, n]; Table[A173018Row[n], {n, 0, 6}]
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
