A088996 → basis A013609 → basis A013609
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-1 + 4\,n + 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 | 3 | 4 | 7 | ||||||
| 2 | 21 | 52 | 32 | 105 | |||||
| 3 | 231 | 824 | 976 | 384 | 2415 | ||||
| 4 | 3465 | 16056 | 27824 | 21376 | 6144 | 74865 | |||
| 5 | 65835 | 374364 | 849776 | 962624 | 544256 | 122880 | 2919735 | ||
| 6 | 1514205 | 10190412 | 28529584 | 42534976 | 35620864 | 15888384 | 2949120 | 137227545 | |
| 7 | 40883535 | 317538864 | 1055630304 | 1947272704 | 2152742656 | 1426370560 | 524500992 | 82575360 | 7547514975 |
Compute more
?
Technical details
- Node id
n-af792834b5732dff· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-c3f9a818c9640494
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: 3, 4; 2: 21, 52, 32; 3: 231, 824, 976, 384; 4: 3465, 16056, 27824, 21376, 6144; 5: 65835, 374364, 849776, 962624, 544256, 122880; 6: 1514205, 10190412, 28529584, 42534976, 35620864, 15888384, 2949120; 7: 40883535, 317538864, 1055630304, 1947272704, 2152742656, 1426370560, 524500992, 82575360; 8: 1267389585, 11151977904, 42885783072, 94145623552, 129047748864, 113105252352, 61903388672, 19343867904, 2642411520; 9: 44358635475, 435945251700, 1902473612064, 4838985014912, 7905913658112, 8604402791424, 6238407688192, 2905557368832, 788863647744, 95126814720;
%F FormulaThe row polynomials satisfy P(n,x) = (4*n-1+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[(4*n - 1 + 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] = (4*n - 1 + 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
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
basis_map_A013609 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.?
Related ?
Candidate equalities ?
- A225471 → x ↦ x/(x+1) 15 rows; no all-index equality certificate was found
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.