|
|
A156788
|
|
Triangle T(n, k) = binomial(n, k)*A000166(n-k)*k^n with T(0, 0) = 1, read by rows.
|
|
1
|
|
|
1, 0, 1, 0, 0, 4, 0, 3, 0, 27, 0, 8, 96, 0, 256, 0, 45, 640, 2430, 0, 3125, 0, 264, 8640, 29160, 61440, 0, 46656, 0, 1855, 118272, 688905, 1146880, 1640625, 0, 823543, 0, 14832, 1899520, 16166304, 41287680, 43750000, 47029248, 0, 16777216, 0, 133497, 34172928, 438143580, 1453326336, 2214843750, 1693052928, 1452729852, 0, 387420489
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
REFERENCES
|
J. Riordan, Combinatorial Identities, Wiley, 1968, p.194.
|
|
LINKS
|
|
|
FORMULA
|
T(n, k) = binomial(n, k)*A000166(n-k)*k^n with T(0, 0) = 1.
T(n, k) = binomial(n, k)*b(n-k)*k^n, where b(n) = n*b(n-1) + (-1)^n and b(0) = 1.
|
|
EXAMPLE
|
Triangle begins as:
1;
0, 1;
0, 0, 4;
0, 3, 0, 27;
0, 8, 96, 0, 256;
0, 45, 640, 2430, 0, 3125;
0, 264, 8640, 29160, 61440, 0, 46656;
0, 1855, 118272, 688905, 1146880, 1640625, 0, 823543;
0, 14832, 1899520, 16166304, 41287680, 43750000, 47029248, 0, 16777216;
|
|
MATHEMATICA
|
T[n_, k_]:= If[n==0, 1, Binomial[n, k]*A000166[n-k]*k^n];
Table[T[n, k], {n, 0, 12}, {k, 0, n}]//Flatten (* modified by G. C. Greubel, Jun 10 2021 *)
|
|
PROG
|
(Sage)
def A156788(n, k): return 1 if (n==0) else binomial(n, k)*k^n*A000166(n-k)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|