A290319 → x ↦ x+1 → 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 + 2\,x + 4\,n\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 | 2 | 5 | ||||||
| 2 | 21 | 20 | 4 | 45 | |||||
| 3 | 231 | 262 | 84 | 8 | 585 | ||||
| 4 | 3465 | 4392 | 1784 | 288 | 16 | 9945 | |||
| 5 | 65835 | 90378 | 42680 | 9040 | 880 | 32 | 208845 | ||
| 6 | 1514205 | 2210364 | 1162396 | 293280 | 38320 | 2496 | 64 | 5221125 | |
| 7 | 40883535 | 62708238 | 35805420 | 10243352 | 1621200 | 144032 | 6720 | 128 | 151412625 |
Compute more
?
Technical details
- Node id
n-5698b48b2f326a5d· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-d4b08ed17b79e9b2
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, 2; 2: 21, 20, 4; 3: 231, 262, 84, 8; 4: 3465, 4392, 1784, 288, 16; 5: 65835, 90378, 42680, 9040, 880, 32; 6: 1514205, 2210364, 1162396, 293280, 38320, 2496, 64; 7: 40883535, 62708238, 35805420, 10243352, 1621200, 144032, 6720, 128; 8: 1267389585, 2025722448, 1235384496, 389154752, 70743904, 7707392, 496384, 17408, 256; 9: 44358635475, 73435064850, 47289902256, 16091185312, 3254346144, 411246528, 32788224, 1602048, 43776, 512;
%F FormulaThe row polynomials satisfy P(n,x) = (4*n-1+2*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 + 2*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 + 2*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 ›
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.