|
|
A195205
|
|
Triangle of coefficients of a sequence of binomial type polynomials.
|
|
4
|
|
|
3, 6, 9, 30, 54, 27, 222, 468, 324, 81, 2190, 5130, 4320, 1620, 243, 27006, 68400, 65610, 30780, 7290, 729, 399630, 1076166, 1135890, 618030, 187110, 30618, 2187, 6899262, 19532268, 22212792, 13471920, 4796820, 1020600, 122472, 6561
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Define a polynomial sequence P_n(x) by means of the recursion
P_(n+1)(x) = x*(P_n(x) + 2*P_n(x+1)), with P_0(x) = 1.
The first few values are
P_1(x) = 3*x, P_2(x) = 3*x*(3*x + 2),
P_3(x) = 3*x*(9*x^2 + 18*x + 10),
P_4(x) = 3*x*(27*x^3 + 108*x^2 + 156*x + 74).
The present table shows the coefficients of these polynomials (excluding P_0(x)) in ascending powers of x. Compare with A195204.
Triangle T(n,k) (1 <= k <= n), read by rows, given by (0, 2, 3, 4, 6, 6, 9, 8, 12, 10, 15, ...) DELTA (3, 0, 3, 0, 3, 0, 3, 0, 3, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Dec 22 2011
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: F(x,z) := (exp(z)/(3 - 2*exp(z)))^x = 1 + 3*x*z + (6*x + 9*x^2)*z^2/2! + (30*x + 54*x^2 + 27*x^3)*z^3/3! + ....
The generating function F(x,z) = Sum_{n>=0} P_n(x)*z^n/n! satisfies the partial differential equation d/dz(F(x,z)) = x*F(x,z) + 2*x*F(x+1,z). Hence the row generating polynomials P_n(x) satisfy the recurrence P_(n+1)(x) = x*(P_n(x) + 2*P_n(x+1)), with P_0(x) = 1. The form of the e.g.f. shows that the polynomials P_n(x) are a sequence of binomial type. In what follows we denote P_n(x) by x^[n].
Relation with rising factorials
x^[n] = Sum_{k=1..n} (-1)^(n-k)*Stirling2(n,k)*3^k*x*(x+1)*...*(x+k-1),
and its inverse formula
3^n*x*(x+1)*...*(x+n-1) = Sum_{k=1..n} |Stirling1(n,k)|*x^[k].
The delta operator D*:
The row polynomials form a polynomial sequence of binomial type. If D denotes the derivative operator 1/3*d/dx then the associated delta operator D* is given by D* = D - 2*D^2/2! + 2*D^3/3! + 6*D^4/4! - 30*D^5/5! - ..., where the sequence of coefficients [1, -2, 2, 6, -30, -42, 882, ...] equals (-1)^n*A179929(n). D* is the lowering operator for the row polynomials, that is, (D*)x^[n] = n*x^[n-1].
Generalized Dobinski formula:
exp(-x)*Sum_{k >= 1} (-k)^[n]*x^k/k! = (-1)^n*Bell(n,3*x),
where the Bell (or exponential) polynomials are defined as
Bell(n,x) := Sum_{k = 1..n} Stirling2(n,k)*x^k.
Relation with the Bell polynomials:
The alternating n-th row entries (-1)^(n+k)*T(n,k) are the connection coefficients expressing the polynomial Bell(n,3*x) as a linear combination of Bell(k,x), 1 <= k <= n. For example for row 4:
Bell(4,3*x) = -222*Bell(1,x) + 468*Bell(2,x) - 324*Bell(3,x) + 81*Bell(4,x).
Generalized Bernoulli summation formula:
We have the following generalization of Bernoulli's formula for the sum of the powers of integers:
3*Sum_{k = 1..n} k^[p] = 1/(p+1)*Sum_{k = 0..p} (-1)^k * binomial(p+1,k)*B_k*n^[p+1-k], where B_k =[1, -1/2, 1/6, 0, -1/30, ...] denotes the sequence of Bernoulli numbers.
Relation with other sequences:
|
|
EXAMPLE
|
Triangle begins
n\k|.....1.......2......3......4......5......6
==============================================
..1|.....3
..2|.....6.......9
..3|....30......54.....27
..4|...222.....468....324.....81
..5|..2190....5130...4320...1620....243
..6|.27006...68400..65610..30780...7290....729
...
Triangle (0, 2, 3, 4, 6, 6, 9, ...) DELTA (3, 0, 3, 0, 3, 0, 3, 0, ...) begins:
1;
0, 3;
0, 6, 9;
0, 30, 54, 27;
0, 222, 468, 324, 81;
0, 2190, 5130, 4320, 1620, 243;
0, 27006, 68400, 65610, 30780, 7290, 729;
|
|
MAPLE
|
# The function BellMatrix is defined in A264428.
# Adds (1, 0, 0, 0, ..) as column 0.
BellMatrix(n -> `if`(n=0, 3, polylog(-n, 2/3)), 10); # Peter Luschny, Jan 29 2016
|
|
MATHEMATICA
|
BellMatrix[f_Function, len_] := With[{t = Array[f, len, 0]}, Table[BellY[n, k, t], {n, 0, len - 1}, {k, 0, len - 1}]];
rows = 10;
M = BellMatrix[If[# == 0, 3, PolyLog[-#, 2/3]]&, rows];
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|