A136572 → basis A013610 → θ+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 + 3\,n x\right)\,P_{n}(x) = \left(n + 6\,n x + 9\,n x^{2} + 3\,n^{2} x + 9\,n^{2} x^{2}\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 | 1 | 6 | 7 | |||||||||||||
| 2 | 2 | 24 | 54 | 80 | ||||||||||||
| 3 | 6 | 108 | 486 | 648 | 1248 | |||||||||||
| 4 | 24 | 576 | 3888 | 10368 | 9720 | 24576 | ||||||||||
| 5 | 120 | 3600 | 32400 | 129600 | 243000 | 174960 | 583680 | |||||||||
| 6 | 720 | 25920 | 291600 | 1555200 | 4374000 | 6298560 | 3674160 | 16220160 | ||||||||
| 7 | 5040 | 211680 | 2857680 | 19051200 | 71442000 | 154314720 | 180033840 | 88179840 | 516096000 | |||||||
| 8 | 40320 | 1935360 | 30481920 | 243855360 | 1143072000 | 3292047360 | 5761082880 | 5643509760 | 2380855680 | 18496880640 | ||||||
| 9 | 362880 | 19595520 | 352719360 | 3292047360 | 18517766400 | 66663959040 | 155549237760 | 228562145280 | 192849310080 | 71425670400 | 737232814080 | |||||
| 10 | 3628800 | 217728000 | 4408992000 | 47029248000 | 308629440000 | 1333279180800 | 3888730944000 | 7618738176000 | 9642465504000 | 7142567040000 | 2357047123200 | 32343117004800 | ||||
| 11 | 39916800 | 2634508800 | 59276448000 | 711317376000 | 5334880320000 | 26887796812800 | 94107288844800 | 230466829824000 | 388912775328000 | 432125305920000 | 285202701907200 | 84853696435200 | 1548664543641600 | |||
| 12 | 479001600 | 34488115200 | 853580851200 | 11381078016000 | 96027845760000 | 553120391577600 | 2258574932275200 | 6637444698931200 | 14000859911808000 | 20742014684160000 | 20534594537318400 | 12218932286668800 | 3309294160972800 | 80363133075456000 | ||
| 13 | 6227020800 | 485707622400 | 13114105804800 | 192340218470400 | 1803189548160000 | 11684668272076800 | 54528451936358400 | 186954692353228800 | 473229065019110400 | 876350120405760000 | 1156782158935603200 | 1032499778223513600 | 559270713204403200 | 138990354760857600 | 4492299138917990400 | |
| 14 | 87178291200 | 7322976460800 | 214197061478400 | 3427152983654400 | 35342515143936000 | 254466109036339200 | 1335947072440780800 | 5234731385890406400 | 15458816123957606400 | 34352924719905792000 | 56682325787844556800 | 67456652177269555200 | 54808529894031513600 | 27242109533128089600 | 6254565964238592000 | 269120060043087052800 |
Compute more
?
Technical details
- Node id
n-c4e421ea1b8043a3· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-3151c955f16eaf46
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: 1, 6; 2: 2, 24, 54; 3: 6, 108, 486, 648; 4: 24, 576, 3888, 10368, 9720; 5: 120, 3600, 32400, 129600, 243000, 174960; 6: 720, 25920, 291600, 1555200, 4374000, 6298560, 3674160; 7: 5040, 211680, 2857680, 19051200, 71442000, 154314720, 180033840, 88179840; 8: 40320, 1935360, 30481920, 243855360, 1143072000, 3292047360, 5761082880, 5643509760, 2380855680; 9: 362880, 19595520, 352719360, 3292047360, 18517766400, 66663959040, 155549237760, 228562145280, 192849310080, 71425670400;
%F FormulaThe row polynomials satisfy (1+3*n*x)*P(n,x) = (n+(3*n^2+6*n)*x+(9*n^2+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[((n + (3*n^2 + 6*n)*x + (9*n^2 + 9*n)*x^2)*P[n - 1, x])/(1 + 3*n*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] = ((n + (3*n^2 + 6*n)*x + (9*n^2 + 9*n)*x^2)*v[i - 1])/(1 + 3*n*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 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_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 ?
- A013610 → θ+1
- basis-map coefficients of A030528, shifted → basis A013610 → θ+1
- A013610 → basis A013611 → θ+1
- basis-map coefficients of A026729, shifted → basis A013610 → θ+1
- A130123 → basis A013610 → θ+1
- A013610 → D → θ+1
- basis-map coefficients of A026729 → basis A013610 → θ+1
- basis-map coefficients of A112227 → basis A013610 → θ+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.