A114655 → θ+1 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-n + n^{2}\right)\,P_{n}(x) = \left(4\,x - 12\,n x + n^{2} + 6\,n^{2} x\right)\,P_{n-1}(x) + \left(-x + 2\,x^{2} + 2\,n x - 4\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 2\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 2 | 2 | ||||||||||||||
| 2 | 4 | 4 | 8 | |||||||||||||
| 3 | 6 | 24 | 8 | 38 | ||||||||||||
| 4 | 8 | 72 | 96 | 16 | 192 | |||||||||||
| 5 | 10 | 160 | 480 | 320 | 32 | 1002 | ||||||||||
| 6 | 12 | 300 | 1600 | 2400 | 960 | 64 | 5336 | |||||||||
| 7 | 14 | 504 | 4200 | 11200 | 10080 | 2688 | 128 | 28814 | ||||||||
| 8 | 16 | 784 | 9408 | 39200 | 62720 | 37632 | 7168 | 256 | 157184 | |||||||
| 9 | 18 | 1152 | 18816 | 112896 | 282240 | 301056 | 129024 | 18432 | 512 | 864146 | ||||||
| 10 | 20 | 1620 | 34560 | 282240 | 1016064 | 1693440 | 1290240 | 414720 | 46080 | 1024 | 4780008 | |||||
| 11 | 22 | 2200 | 59400 | 633600 | 3104640 | 7451136 | 8870400 | 5068800 | 1267200 | 112640 | 2048 | 26572086 | ||||
| 12 | 24 | 2904 | 96800 | 1306800 | 8363520 | 27320832 | 46835712 | 41817600 | 18585600 | 3717120 | 270336 | 4096 | 148321344 | |||
| 13 | 26 | 3744 | 151008 | 2516800 | 20386080 | 86980608 | 202954752 | 260941824 | 181209600 | 64430080 | 10543104 | 638976 | 8192 | 830764794 | ||
| 14 | 28 | 4732 | 227136 | 4580576 | 45805760 | 247351104 | 753831936 | 1319205888 | 1319205888 | 732892160 | 213204992 | 29073408 | 1490944 | 16384 | 4666890936 | |
| 15 | 30 | 5880 | 331240 | 7949760 | 96192096 | 641280640 | 2473511040 | 5653739520 | 7695367680 | 6156294144 | 2798315520 | 678379520 | 78274560 | 3440640 | 32768 | 26283115038 |
Compute more
?
Technical details
- Node id
n-78c1f32e7d3584ec· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-c5faa49c64af63fa
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 -1)
- 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 ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 2; 2: 4, 4; 3: 6, 24, 8; 4: 8, 72, 96, 16; 5: 10, 160, 480, 320, 32; 6: 12, 300, 1600, 2400, 960, 64; 7: 14, 504, 4200, 11200, 10080, 2688, 128; 8: 16, 784, 9408, 39200, 62720, 37632, 7168, 256; 9: 18, 1152, 18816, 112896, 282240, 301056, 129024, 18432, 512; 10: 20, 1620, 34560, 282240, 1016064, 1693440, 1290240, 414720, 46080, 1024;
%F FormulaThe row polynomials satisfy (n^2-n)*P(n,x) = (n^2+(6*n^2-12*n+4)*x)*P(n-1,x) + ((2*n-1)*x-(4*n-2)*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 2.
%t MathematicaP[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + (6*n^2 - 12*n + 4)*x)*P[n - 1, x] + ((2*n - 1)*x - (4*n - 2)*x^2)*D[P[n - 1, x], x])/(n^2 - n)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 2; for(n = 2, N, my(i = n); v[i] = ((n^2 + (6*n^2 - 12*n + 4)*x)*v[i - 1] + ((2*n - 1)*x - (4*n - 2)*x^2)*deriv(v[i - 1], x))/(n^2 - n)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…?
-
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
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents (1<=k<=n). A Schr…?
-
-
from
theta_plus_one of Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k weak ascents…?
Related ?
Same fingerprint ?
References
- [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.