A104684 → basis A013609 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-2 + x + 4\,x^{2} + 2\,n + n x - 2\,n x^{2}\right)\,P_{n-1}(x) + \left(4\,x + 6\,x^{2} + 2\,x^{3}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 2 | 3 | 5 | |||||||||||||
| 3 | 4 | 16 | 13 | 33 | ||||||||||||
| 4 | 8 | 60 | 114 | 63 | 245 | |||||||||||
| 5 | 16 | 192 | 624 | 768 | 321 | 1921 | ||||||||||
| 6 | 32 | 560 | 2720 | 5520 | 5010 | 1683 | 15525 | |||||||||
| 7 | 64 | 1536 | 10320 | 30400 | 44580 | 32016 | 8989 | 127905 | ||||||||
| 8 | 128 | 4032 | 35616 | 141680 | 296520 | 339612 | 201698 | 48639 | 1067925 | |||||||
| 9 | 256 | 10240 | 114688 | 587776 | 1637440 | 2646784 | 2484160 | 1257472 | 265729 | 9004545 | ||||||
| 10 | 512 | 25344 | 350208 | 2236416 | 7926912 | 16890048 | 22194816 | 17635392 | 7777314 | 1462563 | 76499525 | |||||
| 11 | 1024 | 61440 | 1025280 | 7956480 | 34755840 | 93413376 | 160668480 | 177672960 | 122356260 | 47800080 | 8097453 | 653808673 | ||||
| 12 | 2048 | 146432 | 2900480 | 26822400 | 140997120 | 463448832 | 999132288 | 1438388160 | 1372173000 | 833645340 | 292292946 | 45046719 | 5614995765 | |||
| 13 | 4096 | 344064 | 7974912 | 86507520 | 537166080 | 2110040064 | 5531344896 | 9932617728 | 12283341840 | 10298861760 | 5596799472 | 1779856128 | 251595969 | 48416454529 | ||
| 14 | 8192 | 798720 | 21405696 | 268849152 | 1942786560 | 8958014208 | 27917260800 | 60686106624 | 93247453728 | 101004137520 | 75518730144 | 37119747600 | 10799942322 | 1409933619 | 418895174885 | |
| 15 | 16384 | 1835008 | 56283136 | 809582592 | 6725182464 | 35879940096 | 130628289792 | 336199378944 | 623128554048 | 835990611456 | 805220624208 | 543143729856 | 243678752772 | 65336473104 | 7923848253 | 3634723102113 |
Compute more
?
Technical details
- Node id
n-83a30b01f0214b4b· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-e7d8403424fc1d9b
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 3; 3: 4, 16, 13; 4: 8, 60, 114, 63; 5: 16, 192, 624, 768, 321; 6: 32, 560, 2720, 5520, 5010, 1683; 7: 64, 1536, 10320, 30400, 44580, 32016, 8989; 8: 128, 4032, 35616, 141680, 296520, 339612, 201698, 48639; 9: 256, 10240, 114688, 587776, 1637440, 2646784, 2484160, 1257472, 265729; 10: 512, 25344, 350208, 2236416, 7926912, 16890048, 22194816, 17635392, 7777314, 1462563;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (2*n-2+(n+1)*x-(2*n-4)*x^2)*P(n-1,x) + (4*x+6*x^2+2*x^3)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n - 2 + (n + 1)*x - (2*n - 4)*x^2)*P[n - 1, x] + (4*x + 6*x^2 + 2*x^3)*D[P[n - 1, x], x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((2*n - 2 + (n + 1)*x - (2*n - 4)*x^2)*v[i - 1] + (4*x + 6*x^2 + 2*x^3)*deriv(v[i - 1], x))/(n - 1)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
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
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle 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 read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
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) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
Related ?
Same fingerprint ?
- A133214 → basis A007318 → reverse
- A069466 → basis A007318 → basis A013609
- A008459 → x ↦ x+1 → basis A013609
- A133214 → basis A007318
- A104684 → basis A013609
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023