A136572 → basis A013609 → D+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + 2\,x + 2\,n\right)\,P_{n}(x) = \left(n + 4\,n x + 4\,n x^{2} + 2\,n^{2} + 4\,n^{2} 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 | 2 | 5 | ||||||
| 2 | 10 | 24 | 8 | 42 | |||||
| 3 | 42 | 180 | 216 | 48 | 486 | ||||
| 4 | 216 | 1344 | 2880 | 2304 | 384 | 7128 | |||
| 5 | 1320 | 10800 | 33600 | 48000 | 28800 | 3840 | 126360 | ||
| 6 | 9360 | 95040 | 388800 | 806400 | 864000 | 414720 | 46080 | 2624400 | |
| 7 | 75600 | 917280 | 4656960 | 12700800 | 19756800 | 16934400 | 6773760 | 645120 | 62460720 |
Compute more
?
Technical details
- Node id
n-d468705beb32adb2· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-4be2d3b20c0d29e0
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: 10, 24, 8; 3: 42, 180, 216, 48; 4: 216, 1344, 2880, 2304, 384; 5: 1320, 10800, 33600, 48000, 28800, 3840; 6: 9360, 95040, 388800, 806400, 864000, 414720, 46080; 7: 75600, 917280, 4656960, 12700800, 19756800, 16934400, 6773760, 645120; 8: 685440, 9676800, 58705920, 198696960, 406425600, 505774080, 361267200, 123863040, 10321920; 9: 6894720, 111041280, 783820800, 3170119680, 8047226880, 13168189440, 13655900160, 8360755200, 2508226560, 185794560;
%F FormulaThe row polynomials satisfy (2*n-1+2*x)*P(n,x) = (2*n^2+n+(4*n^2+4*n)*x+4*n*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^2 + n + (4*n^2 + 4*n)*x + 4*n*x^2)*P[n - 1, x])/(2*n - 1 + 2*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^2 + n + (4*n^2 + 4*n)*x + 4*n*x^2)*v[i - 1])/(2*n - 1 + 2*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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
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
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
- ↑ Geometric basis map (elementary) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
-
-
from
basis_map_A007318 of Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
basis_map_A013609 of Triangle read by rows: row n consists of n zeros followed by n!.?
Related ?
Same fingerprint ?
- A178822 → basis A013611 → D+1
- A120909 → basis A013610 → D+1
- A178820 → basis A013611 → D+1
- A085881 → basis A013611 → D+1
- basis-map coefficients of A026729 → basis A013609 → D+1
- basis-map coefficients of A026729, shifted → basis A013609 → D+1
- A356546 → basis A013611 → D+1
- basis-map coefficients of A030528, shifted → basis A013609 → D+1
- A038208 → basis A013611 → D+1
- A178821 → basis A013611 → D+1
- A120909 → D+1
- A013609 → D → D+1
- A013609 → D+1
- A130123 → basis A013609 → D+1
- basis-map coefficients of A112227 → basis A013609 → D+1
- A028326 → basis A013611 → D+1
- A156992 → basis A013611 → D+1
- A085880 → basis A013611 → D+1
- A038221 → basis A013611 → D+1
- A013609 → basis A013610 → D+1
- A134082 → basis A013609
- A196347 → basis A013611 → D+1
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.