A125092 → reverse → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 + 3\,x + 3\,x^{2} + x^{3}\right)\,P_{n}(x) = \left(1 + 9\,x + 33\,x^{2} + 63\,x^{3} + 66\,x^{4} + 36\,x^{5} + 8\,x^{6}\right)\,P_{n-3}(x) + \left(-3 - 21\,x - 57\,x^{2} - 75\,x^{3} - 48\,x^{4} - 12\,x^{5}\right)\,P_{n-2}(x) + \left(3 + 15\,x + 27\,x^{2} + 21\,x^{3} + 6\,x^{4}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 5\,x\)
\(P_{2}(x) = 9 + 26\,x + 18\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 4 | 5 | 9 | |||||||||||||
| 2 | 9 | 26 | 18 | 53 | ||||||||||||
| 3 | 16 | 75 | 114 | 56 | 261 | |||||||||||
| 4 | 25 | 164 | 396 | 416 | 160 | 1161 | ||||||||||
| 5 | 36 | 305 | 1020 | 1680 | 1360 | 432 | 4833 | |||||||||
| 6 | 49 | 510 | 2190 | 4960 | 6240 | 4128 | 1120 | 19197 | ||||||||
| 7 | 64 | 791 | 4158 | 12040 | 20720 | 21168 | 11872 | 2816 | 73629 | |||||||
| 8 | 81 | 1160 | 7224 | 25536 | 56000 | 77952 | 67200 | 32768 | 6912 | 274833 | ||||||
| 9 | 100 | 1629 | 11736 | 49056 | 131040 | 231840 | 271488 | 202752 | 87552 | 16640 | 1003833 | |||||
| 10 | 121 | 2210 | 18090 | 87360 | 275520 | 592704 | 880320 | 890880 | 587520 | 227840 | 39424 | 3601989 | ||||
| 11 | 144 | 2915 | 26730 | 146520 | 533280 | 1352736 | 2439360 | 3125760 | 2787840 | 1647360 | 580096 | 92160 | 12734901 | |||
| 12 | 169 | 3756 | 38148 | 234080 | 966240 | 2825856 | 6002304 | 9326592 | 10517760 | 8391680 | 4494336 | 1449984 | 212992 | 44463897 | ||
| 13 | 196 | 4745 | 52884 | 359216 | 1658800 | 5498064 | 13453440 | 24600576 | 33606144 | 33862400 | 24454144 | 11980800 | 3567616 | 487424 | 153586449 | |
| 14 | 225 | 5894 | 71526 | 532896 | 2722720 | 10090080 | 27963936 | 58865664 | 94558464 | 115315200 | 105064960 | 69328896 | 31309824 | 8658944 | 1105920 | 525595149 |
Compute more
?
Technical details
- Node id
n-dc32bd8475ef0877· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-2f7d4833c4308026
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: 4, 5; 2: 9, 26, 18; 3: 16, 75, 114, 56; 4: 25, 164, 396, 416, 160; 5: 36, 305, 1020, 1680, 1360, 432; 6: 49, 510, 2190, 4960, 6240, 4128, 1120; 7: 64, 791, 4158, 12040, 20720, 21168, 11872, 2816; 8: 81, 1160, 7224, 25536, 56000, 77952, 67200, 32768, 6912; 9: 100, 1629, 11736, 49056, 131040, 231840, 271488, 202752, 87552, 16640;
%F FormulaThe row polynomials satisfy (1+3*x+3*x^2+x^3)*P(n,x) = (1+9*x+33*x^2+63*x^3+66*x^4+36*x^5+8*x^6)*P(n-3,x) - (3+21*x+57*x^2+75*x^3+48*x^4+12*x^5)*P(n-2,x) + (3+15*x+27*x^2+21*x^3+6*x^4)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 4 + 5*x, P(2,x) = 9 + 26*x + 18*x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + 5*x;
P[2, x_] := 9 + 26*x + 18*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((1 + 9*x + 33*x^2 + 63*x^3 + 66*x^4 + 36*x^5 + 8*x^6)*P[n - 3, x] - (3 + 21*x + 57*x^2 + 75*x^3 + 48*x^4 + 12*x^5)*P[n - 2, x] + (3 + 15*x + 27*x^2 + 21*x^3 + 6*x^4)*P[n - 1, x])/(1 + 3*x + 3*x^2 + x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 5*x; v[3] = 9 + 26*x + 18*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((1 + 9*x + 33*x^2 + 63*x^3 + 66*x^4 + 36*x^5 + 8*x^6)*v[i - 3] - (3 + 21*x + 57*x^2 + 75*x^3 + 48*x^4 + 12*x^5)*v[i - 2] + (3 + 15*x + 27*x^2 + 21*x^3 + 6*x^4)*v[i - 1])/(1 + 3*x + 3*x^2 + x^3)); 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, 0]
- 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)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
-
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
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
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
-
from
Riordan array (1-x,x/(1-x)).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on differential operators (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
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
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
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
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…?
-
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
-
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
-
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).?
Related ?
Same fingerprint ?
References
- [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [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
- [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
- [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.