A105278 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-n + n x + n^{2}\right)\,P_{n-1}(x) + \left(n x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 2 | 2 | 4 | ||||||
| 3 | 6 | 12 | 3 | 21 | |||||
| 4 | 24 | 72 | 36 | 4 | 136 | ||||
| 5 | 120 | 480 | 360 | 80 | 5 | 1045 | |||
| 6 | 720 | 3600 | 3600 | 1200 | 150 | 6 | 9276 | ||
| 7 | 5040 | 30240 | 37800 | 16800 | 3150 | 252 | 7 | 93289 | |
| 8 | 40320 | 282240 | 423360 | 235200 | 58800 | 7056 | 392 | 8 | 1047376 |
Compute more
?
Technical details
- Node id
n-e64be4d706cd3d64· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-f3c222c4860e5244
Observed on the stored rows ?
- Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept -1)
- Palindromic rows: no
- γ-positive (gamma_positive): no
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 2; 3: 6, 12, 3; 4: 24, 72, 36, 4; 5: 120, 480, 360, 80, 5; 6: 720, 3600, 3600, 1200, 150, 6; 7: 5040, 30240, 37800, 16800, 3150, 252, 7; 8: 40320, 282240, 423360, 235200, 58800, 7056, 392, 8; 9: 362880, 2903040, 5080320, 3386880, 1058400, 169344, 14112, 576, 9; 10: 3628800, 32659200, 65318400, 50803200, 19051200, 3810240, 423360, 25920, 810, 10;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (n^2-n+n*x)*P(n-1,x) + n*x*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 - n + n*x)*P[n - 1, x] + n*x*D[P[n - 1, x], x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((n^2 - n + n*x)*v[i - 1] + n*x*deriv(v[i - 1], x))/(n - 1)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n,k)*(n-1)!/(k-1)!.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
Triangle read by rows: T(n,k) = binomial(n,k)*(n-1)!/(k-1)!.?
Related ?
Same fingerprint ?
- Triangle read by rows: T(n, k) = 2^n * [x^k] hypergeom([-n, -n, 1], [1], x).
- A130534 → basis A008277 → θ+1
- A132393 → basis A008277
- A395972 → D
- A144084: T(n,k) is the number of partial bijections of height k (height(alpha) = |Im(alpha)|) of an n-element set.
- A395972 → reverse
- A271703 → D+1
- A271703 → D
- A144084 → D
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.