A156992 → basis A013610 → x ↦ x+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(5 + 3\,x + 5\,n + 3\,n 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 | 10 | 6 | 16 | |||||||||||||
| 2 | 150 | 180 | 54 | 384 | ||||||||||||
| 3 | 3000 | 5400 | 3240 | 648 | 12288 | |||||||||||
| 4 | 75000 | 180000 | 162000 | 64800 | 9720 | 491520 | ||||||||||
| 5 | 2250000 | 6750000 | 8100000 | 4860000 | 1458000 | 174960 | 23592960 | |||||||||
| 6 | 78750000 | 283500000 | 425250000 | 340200000 | 153090000 | 36741600 | 3674160 | 1321205760 | ||||||||
| 7 | 3150000000 | 13230000000 | 23814000000 | 23814000000 | 14288400000 | 5143824000 | 1028764800 | 88179840 | 84557168640 | |||||||
| 8 | 141750000000 | 680400000000 | 1428840000000 | 1714608000000 | 1285956000000 | 617258880000 | 185177664000 | 31744742400 | 2380855680 | 6088116142080 | ||||||
| 9 | 7087500000000 | 38272500000000 | 91854000000000 | 128595600000000 | 115736040000000 | 69441624000000 | 27776649600000 | 7142567040000 | 1071385056000 | 71425670400 | 487049291366400 | |||||
| 10 | 389812500000000 | 2338875000000000 | 6314962500000000 | 10103940000000000 | 10609137000000000 | 7638578640000000 | 3819289320000000 | 1309470624000000 | 294630890400000 | 39284118720000 | 2357047123200 | 42860337640243200 | ||||
| 11 | 23388750000000000 | 154365750000000000 | 463097250000000000 | 833575050000000000 | 1000290060000000000 | 840243650400000000 | 504146190240000000 | 216062652960000000 | 64818795888000000 | 12963759177600000 | 1555651101312000 | 84853696435200 | 4114592413463347200 | |||
| 12 | 1520268750000000000 | 10945935000000000000 | 36121585500000000000 | 72243171000000000000 | 97528280850000000000 | 93627149616000000000 | 65539004731200000000 | 33705773861760000000 | 12639665198160000000 | 3370577386176000000 | 606703929511680000 | 66185883219456000 | 3309294160972800 | 427917611000188108800 | ||
| 13 | 106418812500000000000 | 830066737500000000000 | 2988240255000000000000 | 6574128561000000000000 | 9861192841500000000000 | 10650088268820000000000 | 8520070615056000000000 | 5112042369033600000000 | 2300419066065120000000 | 766806355355040000000 | 184033525285209600000 | 30114576864852480000 | 3011457686485248000 | 138990354760857600 | 47926772432021068185600 | |
| 14 | 7981410937500000000000 | 67043851875000000000000 | 261471022312500000000000 | 627530453550000000000000 | 1035425248357500000000000 | 1242510298029000000000000 | 1118259268226100000000000 | 766806355355040000000000 | 402573336561396000000000 | 161029334624558400000000 | 48308800387367520000000 | 10540101902698368000000 | 1581015285404755200000 | 145939872498900480000 | 6254565964238592000 | 5751212691842528182272000 |
Compute more
?
Technical details
- Node id
n-cb1e68669081ca55· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-b1029f17d1b64336
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: 10, 6; 2: 150, 180, 54; 3: 3000, 5400, 3240, 648; 4: 75000, 180000, 162000, 64800, 9720; 5: 2250000, 6750000, 8100000, 4860000, 1458000, 174960; 6: 78750000, 283500000, 425250000, 340200000, 153090000, 36741600, 3674160; 7: 3150000000, 13230000000, 23814000000, 23814000000, 14288400000, 5143824000, 1028764800, 88179840; 8: 141750000000, 680400000000, 1428840000000, 1714608000000, 1285956000000, 617258880000, 185177664000, 31744742400, 2380855680; 9: 7087500000000, 38272500000000, 91854000000000, 128595600000000, 115736040000000, 69441624000000, 27776649600000, 7142567040000, 1071385056000, 71425670400;
%F FormulaThe row polynomials satisfy P(n,x) = (5*n+5+(3*n+3)*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(5*n + 5 + (3*n + 3)*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; for(n = 1, N, my(i = n + 1); v[i] = (5*n + 5 + (3*n + 3)*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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
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 T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
-
from
basis_map_A007318 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
-
from
basis_map_A013610 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
Related ?
Same fingerprint ?
- A038255 → basis A013610 → basis A013609
- A178820 → basis A013610 → x ↦ x+1
- A013612 → basis A013609 → reverse
- A038221 → basis A013610 → basis A007318
- A013622 → D
- A178822 → basis A013610 → basis A007318
- A027467 → basis A013611 → basis A013610
- A196347 → basis A013610 → basis A007318
- A038329 → basis A013610
- A038329 → basis A013610 → reverse
- A038334 → x ↦ x/(x+1)
- A085880 → basis A013610 → x ↦ x+1
- A178821 → basis A013610 → x ↦ x+1
- A013620 → basis A007318 → D
- A038243 → basis A013611 → x ↦ x/(x+1)
- A038271 → basis A013611 → D
- A013612 → basis A013609
- A013622 → basis A013609 → basis A013610
- A013622: Triangle of coefficients in expansion of (3+5x)^n.
- A038284 → basis A007318 → basis A013609
- A013612 → basis A013609 → D
- A038319 → basis A013611 → basis A013610
- A028326 → basis A013610 → x ↦ x+1
- A038271 → basis A013610 → basis A013610
- A038231 → D → basis A013610
- A038338 → basis A013610 → x ↦ x+1
- A038329 → basis A013610 → D
- A013620 → basis A007318
- A120910 → basis A013609 → x ↦ x/(x+1)
- A038271 → basis A013611
- A038335 → x ↦ x+1 → basis A013609
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.