A104684 → basis A013611 → basis A007318
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-31 - 20\,x + 19\,n + 12\,n x\right)\,P_{n-1}(x) + \left(-15 - 22\,x - 8\,x^{2}\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 | 7 | 4 | 11 | |||||||||||||
| 3 | 61 | 64 | 16 | 141 | ||||||||||||
| 4 | 595 | 900 | 432 | 64 | 1991 | |||||||||||
| 5 | 6145 | 12160 | 8640 | 2560 | 256 | 29761 | ||||||||||
| 6 | 65527 | 160420 | 151360 | 67840 | 14080 | 1024 | 460251 | |||||||||
| 7 | 712909 | 2081088 | 2451600 | 1477120 | 472320 | 73728 | 4096 | 7272861 | ||||||||
| 8 | 7863667 | 26665828 | 37688112 | 28571200 | 12409600 | 3032064 | 372736 | 16384 | 116619591 | |||||||
| 9 | 87615745 | 338490880 | 558202624 | 510404608 | 280806400 | 94044160 | 18350080 | 1835008 | 65536 | 1889815041 | ||||||
| 10 | 983726695 | 4265416260 | 8040695040 | 8612029440 | 5741632512 | 2450165760 | 660602880 | 106168320 | 8847360 | 262144 | 30869546411 | |||||
| 11 | 11112210781 | 53436147520 | 113351510160 | 139195607040 | 109084308480 | 56648761344 | 19565199360 | 4376494080 | 592773120 | 41943040 | 1048576 | 507406003501 | ||||
| 12 | 126142119187 | 666244968004 | 1570688350000 | 2175593555520 | 1960099384320 | 1200302788608 | 506427457536 | 145819238400 | 27671592960 | 3215196160 | 196083712 | 4194304 | 8382404928711 | |||
| 13 | 1437751935361 | 8273850125184 | 21461336842176 | 33101306022400 | 33711374188800 | 23791996698624 | 11871496175616 | 4190484824064 | 1028195942400 | 168401305600 | 17024679936 | 905969664 | 16777216 | 139054141487041 | ||
| 14 | 16443380994775 | 102405942910180 | 289838121797952 | 492641133048064 | 559671861548800 | 447391102878720 | 257869141770240 | 107938105786368 | 32573383704576 | 6926585036800 | 992644956160 | 88332042240 | 4143972352 | 67108864 | 2314783947556091 | |
| 15 | 188609259215725 | 1263855432884800 | 3875918422339600 | 7198065061358080 | 9025027885409536 | 8061006738104320 | 5272390466703360 | 2554739172311040 | 916514139340800 | 240431203876864 | 44908187484160 | 5694690426880 | 450384363520 | 18790481920 | 268435456 | 38647630102736061 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(\left(1 - n\right)\,P_{n}(x) = \left(-50 - 80\,x - 32\,x^{2} + 25\,n + 40\,n x + 16\,n x^{2}\right)\,P_{n-2}(x) + \left(21 + 12\,x - 14\,n - 8\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 7 + 4\,x\)
Technical details
- Node id
n-669d4405c319a323· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-94ca338fcc0ee6de)- Fingerprint
f6-20efcd8d91464382
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: 7, 4; 3: 61, 64, 16; 4: 595, 900, 432, 64; 5: 6145, 12160, 8640, 2560, 256; 6: 65527, 160420, 151360, 67840, 14080, 1024; 7: 712909, 2081088, 2451600, 1477120, 472320, 73728, 4096; 8: 7863667, 26665828, 37688112, 28571200, 12409600, 3032064, 372736, 16384; 9: 87615745, 338490880, 558202624, 510404608, 280806400, 94044160, 18350080, 1835008, 65536; 10: 983726695, 4265416260, 8040695040, 8612029440, 5741632512, 2450165760, 660602880, 106168320, 8847360, 262144;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = (19*n-31+(12*n-20)*x)*P(n-1,x) - (15+22*x+8*x^2)*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[((19*n - 31 + (12*n - 20)*x)*P[n - 1, x] - (15 + 22*x + 8*x^2)*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] = ((19*n - 31 + (12*n - 20)*x)*v[i - 1] - (15 + 22*x + 8*x^2)*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 (−∞, -1]
- 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)
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013611 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_A013611 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 ?
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