A136572 → basis A013610 → D+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-2 + 3\,x + 3\,n\right)\,P_{n}(x) = \left(n + 6\,n x + 9\,n x^{2} + 3\,n^{2} + 9\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 4 | 3 | 7 | |||||||||||||
| 2 | 14 | 48 | 18 | 80 | ||||||||||||
| 3 | 60 | 378 | 648 | 162 | 1248 | |||||||||||
| 4 | 312 | 2880 | 9072 | 10368 | 1944 | 24576 | ||||||||||
| 5 | 1920 | 23400 | 108000 | 226800 | 194400 | 29160 | 583680 | |||||||||
| 6 | 13680 | 207360 | 1263600 | 3888000 | 6123600 | 4199040 | 524880 | 16220160 | ||||||||
| 7 | 110880 | 2010960 | 15240960 | 61916400 | 142884000 | 180033840 | 102876480 | 11022480 | 516096000 | |||||||
| 8 | 1008000 | 21288960 | 193052160 | 975421440 | 2971987200 | 5486745600 | 5761082880 | 2821754880 | 264539520 | 18496880640 | ||||||
| 9 | 10160640 | 244944000 | 2586608640 | 15637224960 | 59256852480 | 144438577920 | 222213196800 | 199991877120 | 85710804480 | 7142567040 | 737232814080 | |||||
| 10 | 112492800 | 3048192000 | 36741600000 | 258660864000 | 1172791872000 | 3555411148800 | 7221928896000 | 9523422720000 | 7499695392000 | 2857026816000 | 214277011200 | 32343117004800 | ||||
| 11 | 1357171200 | 40834886400 | 553246848000 | 4445733600000 | 23473473408000 | 85144689907200 | 215102374502400 | 374508598464000 | 432125305920000 | 302487714144000 | 103710073420800 | 7071141369600 | 1548664543641600 | |||
| 12 | 17723059200 | 586297958400 | 8820335462400 | 79667546112000 | 480139228800000 | 2028108102451200 | 6130417673318400 | 13274889397862400 | 20223464317056000 | 20742014684160000 | 13067469251020800 | 4072977428889600 | 254561089305600 | 80363133075456000 | ||
| 13 | 249080832000 | 8985591014400 | 148626532454400 | 1490636693145600 | 10097861469696000 | 48686117800320000 | 171375134657126400 | 444017394338918400 | 841296115589529600 | 1139255156527488000 | 1051620144486912000 | 602291537297049600 | 172083296370585600 | 9927882482918400 | 4492299138917990400 | |
| 14 | 3748666521600 | 146459529216000 | 2641763758233600 | 29130800361062400 | 219123593892403200 | 1187508508836249600 | 4771239544431360000 | 14395511311198617600 | 32635278483910502400 | 54964679551849267200 | 66988203203816294400 | 56213876814391296000 | 29512285327555430400 | 7783459866608025600 | 416971064282572800 | 269120060043087052800 |
Compute more
?
Technical details
- Node id
n-c4eea4ee44016286· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-1f45c55ca90e4ac8
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: 4, 3; 2: 14, 48, 18; 3: 60, 378, 648, 162; 4: 312, 2880, 9072, 10368, 1944; 5: 1920, 23400, 108000, 226800, 194400, 29160; 6: 13680, 207360, 1263600, 3888000, 6123600, 4199040, 524880; 7: 110880, 2010960, 15240960, 61916400, 142884000, 180033840, 102876480, 11022480; 8: 1008000, 21288960, 193052160, 975421440, 2971987200, 5486745600, 5761082880, 2821754880, 264539520; 9: 10160640, 244944000, 2586608640, 15637224960, 59256852480, 144438577920, 222213196800, 199991877120, 85710804480, 7142567040;
%F FormulaThe row polynomials satisfy (3*n-2+3*x)*P(n,x) = (3*n^2+n+(9*n^2+6*n)*x+9*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[((3*n^2 + n + (9*n^2 + 6*n)*x + 9*n*x^2)*P[n - 1, x])/(3*n - 2 + 3*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] = ((3*n^2 + n + (9*n^2 + 6*n)*x + 9*n*x^2)*v[i - 1])/(3*n - 2 + 3*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_A013610 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!.?
-
Geometric basis map (elementary) polytool ? step ›
-
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) polytool ? step ›
-
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!.?
-
-
from
basis_map_A013610 of Triangle read by rows: row n consists of n zeros followed by n!.?
Related ?
Same fingerprint ?
- basis-map coefficients of A026729 → basis A013610 → D+1
- basis-map coefficients of A026729, shifted → basis A013610 → D+1
- A013610 → basis A013611 → D+1
- basis-map coefficients of A112227 → basis A013610 → D+1
- A013610 → D+1
- A013610 → D → D+1
- A130123 → basis A013610 → D+1
- basis-map coefficients of A030528, shifted → basis A013610 → 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.