A088996 → basis A013610 → x ↦ x/(x+1)
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 + x\right)\,P_{n}(x) = \left(-1 - 2\,x - x^{2} + 2\,n + 7\,n x + 5\,n x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 4 | 5 | ||||||
| 2 | 3 | 21 | 36 | 60 | |||||
| 3 | 15 | 147 | 474 | 504 | 1140 | ||||
| 4 | 105 | 1314 | 6111 | 12534 | 9576 | 29640 | |||
| 5 | 945 | 14346 | 86535 | 259470 | 387000 | 229824 | 978120 | ||
| 6 | 10395 | 185211 | 1367919 | 5363685 | 11781630 | 13751064 | 6664896 | 39124800 | |
| 7 | 135135 | 2761173 | 24080121 | 116237151 | 335526480 | 579339252 | 554179824 | 226606464 | 1838865600 |
Compute more
?
Technical details
- Node id
n-2cc49758a2bbacea· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-b903ea8a3904092b
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 0)
- 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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 1, 4; 2: 3, 21, 36; 3: 15, 147, 474, 504; 4: 105, 1314, 6111, 12534, 9576; 5: 945, 14346, 86535, 259470, 387000, 229824; 6: 10395, 185211, 1367919, 5363685, 11781630, 13751064, 6664896; 7: 135135, 2761173, 24080121, 116237151, 335526480, 579339252, 554179824, 226606464; 8: 2027025, 46687860, 468887562, 2682681984, 9566146089, 21775621500, 30906928188, 25012110096, 8837652096; 9: 34459425, 882882720, 10025354394, 66236646456, 280662490809, 791095993416, 1483545125196, 1785110711904, 1250772929856, 388856692224;
%F FormulaThe row polynomials satisfy (1+x)*P(n,x) = (2*n-1+(7*n-2)*x+(5*n-1)*x^2)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 1 + (7*n - 2)*x + (5*n - 1)*x^2)*P[n - 1, x])/(1 + x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((2*n - 1 + (7*n - 2)*x + (5*n - 1)*x^2)*v[i - 1])/(1 + x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
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.