A063007 → basis A013609 → basis A013609
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - n\right)\,P_{n}(x) = \left(-2 + n\right)\,P_{n-2}(x) + \left(21 + 24\,x - 14\,n - 16\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 7 + 8\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 7 | 8 | 15 | |||||||||||||
| 3 | 73 | 168 | 96 | 337 | ||||||||||||
| 4 | 847 | 2928 | 3360 | 1280 | 8415 | |||||||||||
| 5 | 10321 | 47600 | 82080 | 62720 | 17920 | 220641 | ||||||||||
| 6 | 129367 | 746040 | 1716960 | 1971200 | 1128960 | 258048 | 5950575 | |||||||||
| 7 | 1651609 | 11431896 | 32907840 | 50426880 | 43384320 | 19869696 | 3784704 | 163456945 | ||||||||
| 8 | 21360031 | 172513376 | 596175552 | 1142776320 | 1312227840 | 902651904 | 344408064 | 56229888 | 4548342975 | |||||||
| 9 | 278905249 | 2574635616 | 10383710400 | 23897448960 | 34326673920 | 31513337856 | 18056822784 | 5904138240 | 843448320 | 127779121345 | ||||||
| 10 | 3668760487 | 38103627240 | 175671397440 | 471870981120 | 813825492480 | 934588182528 | 714646732800 | 350874501120 | 100370350080 | 12745441280 | 3616365466575 | |||||
| 11 | 48543499753 | 560226229640 | 2906259380640 | 8924581585920 | 17965423956480 | 24771808309248 | 23694290780160 | 15523947479040 | 6667458969600 | 1695143690240 | 193730707456 | 102951414588177 | ||||
| 12 | 645382441711 | 8193411585744 | 47234674687200 | 163222396296960 | 375646252101120 | 604572833120256 | 694325279391744 | 569013853224960 | 326103267409920 | 124471979540480 | 28478413996032 | 2958796259328 | 2944866540055455 | |||
| 13 | 8614382884849 | 119310595504464 | 756700125269088 | 2905984629067520 | 7526195653616640 | 13848553885630464 | 18563927839801344 | 18266359862919168 | 13093986083143680 | 6668695277404160 | 2290478154252288 | 476366197751808 | 45368209309696 | 84570540896555169 | ||
| 14 | 115367108888311 | 1731069988555544 | 11978294225133600 | 50609897414236160 | 145674877705477120 | 301652398977785856 | 462312788133740544 | 530966952133263360 | 456985099840389120 | 291101940493844480 | 133402383962079232 | 41648016146300928 | 7939436629196800 | 697972450918400 | 2436816495209809455 | |
| 15 | 1549456900170553 | 25038606115379640 | 187712258889267840 | 865343168838686720 | 2740460656022369280 | 6307003270762242048 | 10878050291040092160 | 14283918107989770240 | 14349201693681254400 | 10974311091446743040 | 6290092392821293056 | 2620014087634944000 | 749709658842726400 | 131916793223577600 | 10768717814169600 | 70415090252022686577 |
Compute more
?
Technical details
- Node id
n-5f4ababfd0b4d529· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-39bd0966006c2875
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, 8; 3: 73, 168, 96; 4: 847, 2928, 3360, 1280; 5: 10321, 47600, 82080, 62720, 17920; 6: 129367, 746040, 1716960, 1971200, 1128960, 258048; 7: 1651609, 11431896, 32907840, 50426880, 43384320, 19869696, 3784704; 8: 21360031, 172513376, 596175552, 1142776320, 1312227840, 902651904, 344408064, 56229888; 9: 278905249, 2574635616, 10383710400, 23897448960, 34326673920, 31513337856, 18056822784, 5904138240, 843448320; 10: 3668760487, 38103627240, 175671397440, 471870981120, 813825492480, 934588182528, 714646732800, 350874501120, 100370350080, 12745441280;
%F FormulaThe row polynomials satisfy -(n-1)*P(n,x) = (n-2)*P(n-2,x) - (14*n-21+(16*n-24)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 7 + 8*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 7 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2)*P[n - 2, x] - (14*n - 21 + (16*n - 24)*x)*P[n - 1, x])/(-n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 7 + 8*x; for(n = 3, N, my(i = n); v[i] = ((n - 2)*v[i - 2] - (14*n - 21 + (16*n - 24)*x)*v[i - 1])/(-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
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- 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_A013609 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
Geometric basis map (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) [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.?
- ↑ Three-term recurrence criterion (above)
- ↑ 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
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,…?
- ↑ 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,…?
- ↑ 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.?
-
Geometric basis map (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)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ 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.?
-
-
from
basis_map_A013609 of T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
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