A225470 → basis A013609 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-9 + 12\,x - 4\,x^{2} + 18\,n - 12\,n x - 9\,n^{2}\right)\,P_{n-2}(x) + \left(-3 + 4\,x + 6\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 3 | 4 | 7 | |||||||||||||
| 2 | 18 | 36 | 12 | 66 | ||||||||||||
| 3 | 162 | 396 | 216 | 32 | 806 | |||||||||||
| 4 | 1944 | 5400 | 3780 | 960 | 80 | 12164 | ||||||||||
| 5 | 29160 | 88776 | 72900 | 24480 | 3600 | 192 | 219108 | |||||||||
| 6 | 524880 | 1714608 | 1578528 | 635040 | 126000 | 12096 | 448 | 4591600 | ||||||||
| 7 | 11022480 | 38106288 | 38292912 | 17545248 | 4233600 | 556416 | 37632 | 1024 | 109795600 | |||||||
| 8 | 264539520 | 958640832 | 1033348752 | 523200384 | 145469520 | 23514624 | 2201472 | 110592 | 2304 | 2951028000 | ||||||
| 9 | 7142567040 | 26941460544 | 30776338800 | 16882007040 | 5235678000 | 984021696 | 114307200 | 8017920 | 311040 | 5120 | 88084714400 | |||||
| 10 | 214277011200 | 836814084480 | 1004114545632 | 588530448000 | 199275357600 | 42086278080 | 5725266624 | 501811200 | 27371520 | 844800 | 11264 | 2891353030400 | ||||
| 11 | 7071141369600 | 28471972832640 | 35646222259296 | 22099143572352 | 8047412920800 | 1867108034880 | 287135114112 | 29646093312 | 2032335360 | 88704000 | 2230272 | 24576 | 103521905491200 | |||
| 12 | 254561089305600 | 1053275587453440 | 1368679919832576 | 890625761296128 | 344954724079680 | 86529680265600 | 14693449522752 | 1723568191488 | 139867782912 | 7709644800 | 275438592 | 5750784 | 53248 | 4015191638617600 | ||
| 13 | 9927882482918400 | 42095992267906560 | 56538343635830784 | 38384217810102528 | 15679798642347840 | 4202548868149632 | 774947118673728 | 100804186948608 | 9332871964416 | 611493442560 | 27703323648 | 825237504 | 14536704 | 114688 | 167714507921497600 | |
| 14 | 416971064282572800 | 1807743205183749120 | 2500898409508612608 | 1762906064386521600 | 754512087503865600 | 214138569203919360 | 42353726343312384 | 6005083551667200 | 618790043139840 | 46422440064000 | 2508825166848 | 95103590400 | 2398556160 | 36126720 | 245760 | 7506196028811110400 |
Compute more
?
Technical details
- Node id
n-6ce02af0438033a9· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-09d18f264aa0068a
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 ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 3, 4; 2: 18, 36, 12; 3: 162, 396, 216, 32; 4: 1944, 5400, 3780, 960, 80; 5: 29160, 88776, 72900, 24480, 3600, 192; 6: 524880, 1714608, 1578528, 635040, 126000, 12096, 448; 7: 11022480, 38106288, 38292912, 17545248, 4233600, 556416, 37632, 1024; 8: 264539520, 958640832, 1033348752, 523200384, 145469520, 23514624, 2201472, 110592, 2304; 9: 7142567040, 26941460544, 30776338800, 16882007040, 5235678000, 984021696, 114307200, 8017920, 311040, 5120;
%F FormulaThe row polynomials satisfy P(n,x) = -(9*n^2-18*n+9+(12*n-12)*x+4*x^2)*P(n-2,x) + (6*n-3+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(9*n^2 - 18*n + 9 + (12*n - 12)*x + 4*x^2)*P[n - 2, x] + (6*n - 3 + 4*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; v[2] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(9*n^2 - 18*n + 9 + (12*n - 12)*x + 4*x^2)*v[i - 2] + (6*n - 3 + 4*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 Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows, s_3(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_3(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 ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, s_3(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_3(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
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.