A225471 → basis A013609 → reverse
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(2 + 4\,n x\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 | 2 | 4 | 6 | ||||||
| 2 | 4 | 24 | 32 | 60 | |||||
| 3 | 8 | 96 | 352 | 384 | 840 | ||||
| 4 | 16 | 320 | 2240 | 6400 | 6144 | 15120 | |||
| 5 | 32 | 960 | 10880 | 57600 | 140288 | 122880 | 332640 | ||
| 6 | 64 | 2688 | 44800 | 376320 | 1662976 | 3612672 | 2949120 | 8648640 | |
| 7 | 128 | 7168 | 164864 | 2007040 | 13862912 | 53788672 | 107053056 | 82575360 | 259459200 |
Compute more
?
Technical details
- Node id
n-147f63c45421b877· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-181e40cb14f29d52
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: 2, 4; 2: 4, 24, 32; 3: 8, 96, 352, 384; 4: 16, 320, 2240, 6400, 6144; 5: 32, 960, 10880, 57600, 140288, 122880; 6: 64, 2688, 44800, 376320, 1662976, 3612672, 2949120; 7: 128, 7168, 164864, 2007040, 13862912, 53788672, 107053056, 82575360; 8: 256, 18432, 559104, 9289728, 91951104, 551190528, 1935343616, 3590848512, 2642411520; 9: 512, 46080, 1781760, 38707200, 518332416, 4412620800, 23713546240, 76854067200, 134555369472, 95126814720;
%F FormulaThe row polynomials satisfy P(n,x) = (2+4*n*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2 + 4*n*x)*P[n - 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 + 4*n*x)*v[i - 1]); 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 (−∞, 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 ›
-
from
basis_map_A013609 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013609 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
Related ?
Same fingerprint ?
- A204420 → reverse
- A109692 → x ↦ x/(x+1)
- A204420: Triangle T(n,k) giving number of degree-2n permutations which decompose into exactly k cycles of even length, …
- A225471 → basis A013609
- A028338 → x ↦ x+1
- A204420 → basis A007318 → x ↦ x+1
- A028338 → x ↦ x+1 → reverse
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
- [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.