A007318 → −D²+(−1+n)D+1+n → x ↦ x+1 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4 - 12\,x - 12\,x^{2} - 4\,x^{3} - n^{2} - 3\,n^{2} x - 3\,n^{2} x^{2} - n^{2} x^{3} + n^{3} + 3\,n^{3} x + 3\,n^{3} x^{2} + n^{3} x^{3}\right)\,P_{n}(x) = \left(-16 - 60\,x - 66\,x^{2} + 2\,x^{3} + 42\,x^{4} + 18\,x^{5} - 4\,n - 24\,n x - 57\,n x^{2} - 67\,n x^{3} - 39\,n x^{4} - 9\,n x^{5} + 2\,n^{2} + 3\,n^{2} x - 12\,n^{2} x^{2} - 34\,n^{2} x^{3} - 30\,n^{2} x^{4} - 9\,n^{2} x^{5} + 2\,n^{3} + 9\,n^{3} x + 15\,n^{3} x^{2} + 11\,n^{3} x^{3} + 3\,n^{3} x^{4}\right)\,P_{n-1}(x) + \left(8\,x + 48\,x^{2} + 114\,x^{3} + 134\,x^{4} + 78\,x^{5} + 18\,x^{6} + 4\,n x + 24\,n x^{2} + 57\,n x^{3} + 67\,n x^{4} + 39\,n x^{5} + 9\,n x^{6}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 6\,x\)
\(P_{2}(x) = 14 + 42\,x + 31\,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 | 6 | 10 | |||||||||||||
| 2 | 14 | 42 | 31 | 87 | ||||||||||||
| 3 | 44 | 198 | 294 | 144 | 680 | |||||||||||
| 4 | 128 | 768 | 1716 | 1692 | 621 | 4925 | ||||||||||
| 5 | 352 | 2640 | 7880 | 11700 | 8640 | 2538 | 33750 | |||||||||
| 6 | 928 | 8352 | 31200 | 61920 | 68850 | 40662 | 9963 | 221875 | ||||||||
| 7 | 2368 | 24864 | 111552 | 277200 | 412020 | 366282 | 180306 | 37908 | 1412500 | |||||||
| 8 | 5888 | 70656 | 370048 | 1104768 | 2056320 | 2443392 | 1809864 | 763992 | 140697 | 8765625 | ||||||
| 9 | 14336 | 193536 | 1158912 | 4040064 | 9035712 | 13444704 | 13308624 | 8450568 | 3123036 | 511758 | 53281250 | |||||
| 10 | 34304 | 514560 | 3467520 | 13824000 | 36106560 | 64556352 | 80015040 | 67884480 | 37725750 | 12400290 | 1830519 | 318359375 | ||||
| 11 | 80896 | 1334784 | 9996800 | 44858880 | 134006400 | 279816768 | 416731392 | 442648800 | 328618620 | 162384750 | 48065886 | 6456024 | 1875000000 | |||
| 12 | 188416 | 3391488 | 27945984 | 139392000 | 468737280 | 1119495168 | 1947141504 | 2484991872 | 2309472000 | 1524251520 | 678118716 | 182579508 | 22497669 | 10908203125 | ||
| 13 | 434176 | 8466432 | 76118016 | 417770496 | 1561697280 | 4198791168 | 8353103616 | 12449593728 | 13900711968 | 11483849520 | 6822757656 | 2760422652 | 681661656 | 77590386 | 62792968750 | |
| 14 | 991232 | 20815872 | 202768384 | 1214373888 | 4995454464 | 14931012096 | 33439101696 | 57003927552 | 74327277024 | 73766845152 | 54852269472 | 29632835232 | 10994097114 | 2507338638 | 265189059 | 358154296875 |
Compute more
?
Technical details
- Node id
n-47dbbceb54d8e6b2· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-e6bf57180a08ced6
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, 6; 2: 14, 42, 31; 3: 44, 198, 294, 144; 4: 128, 768, 1716, 1692, 621; 5: 352, 2640, 7880, 11700, 8640, 2538; 6: 928, 8352, 31200, 61920, 68850, 40662, 9963; 7: 2368, 24864, 111552, 277200, 412020, 366282, 180306, 37908; 8: 5888, 70656, 370048, 1104768, 2056320, 2443392, 1809864, 763992, 140697; 9: 14336, 193536, 1158912, 4040064, 9035712, 13444704, 13308624, 8450568, 3123036, 511758;
%F FormulaThe row polynomials satisfy (n^3-n^2-4+(3*n^3-3*n^2-12)*x+(3*n^3-3*n^2-12)*x^2+(n^3-n^2-4)*x^3)*P(n,x) = (2*n^3+2*n^2-4*n-16+(9*n^3+3*n^2-24*n-60)*x+(15*n^3-12*n^2-57*n-66)*x^2+(11*n^3-34*n^2-67*n+2)*x^3+(3*n^3-30*n^2-39*n+42)*x^4-(9*n^2+9*n-18)*x^5)*P(n-1,x) + ((4*n+8)*x+(24*n+48)*x^2+(57*n+114)*x^3+(67*n+134)*x^4+(39*n+78)*x^5+(9*n+18)*x^6)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 4 + 6*x, P(2,x) = 14 + 42*x + 31*x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + 6*x;
P[2, x_] := 14 + 42*x + 31*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^3 + 2*n^2 - 4*n - 16 + (9*n^3 + 3*n^2 - 24*n - 60)*x + (15*n^3 - 12*n^2 - 57*n - 66)*x^2 + (11*n^3 - 34*n^2 - 67*n + 2)*x^3 + (3*n^3 - 30*n^2 - 39*n + 42)*x^4 - (9*n^2 + 9*n - 18)*x^5)*P[n - 1, x] + ((4*n + 8)*x + (24*n + 48)*x^2 + (57*n + 114)*x^3 + (67*n + 134)*x^4 + (39*n + 78)*x^5 + (9*n + 18)*x^6)*D[P[n - 1, x], x])/(n^3 - n^2 - 4 + (3*n^3 - 3*n^2 - 12)*x + (3*n^3 - 3*n^2 - 12)*x^2 + (n^3 - n^2 - 4)*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 + 6*x; v[3] = 14 + 42*x + 31*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((2*n^3 + 2*n^2 - 4*n - 16 + (9*n^3 + 3*n^2 - 24*n - 60)*x + (15*n^3 - 12*n^2 - 57*n - 66)*x^2 + (11*n^3 - 34*n^2 - 67*n + 2)*x^3 + (3*n^3 - 30*n^2 - 39*n + 42)*x^4 - (9*n^2 + 9*n - 18)*x^5)*v[i - 1] + ((4*n + 8)*x + (24*n + 48)*x^2 + (57*n + 114)*x^3 + (67*n + 134)*x^4 + (39*n + 78)*x^5 + (9*n + 18)*x^6)*deriv(v[i - 1], x))/(n^3 - n^2 - 4 + (3*n^3 - 3*n^2 - 12)*x + (3*n^3 - 3*n^2 - 12)*x^2 + (n^3 - n^2 - 4)*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
shift_x_plus_one of Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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?
-
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?
-
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…?
-
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 [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)
-
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 [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 (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…?
- ↑ 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.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
- ↑ 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
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) (above)
- ↑ 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.?
-
from
Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
-
from
Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
-
-
from
shift_x_plus_one of Triangle read by rows: T(n, k) = (n-k+1)*(k+1)*binomial(n, k).?
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.