A132812 → basis A007318 → basis A013609
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(2\,n + n^{2}\right)\,P_{n}(x) = \left(-n - 4\,n x - 4\,n x^{2} - n^{2} - 4\,n^{2} x - 4\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(3 + 2\,x + 9\,n + 6\,n x + 6\,n^{2} + 4\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 6 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 6 | 4 | 10 | |||||||||||||
| 2 | 33 | 42 | 12 | 87 | ||||||||||||
| 3 | 180 | 336 | 192 | 32 | 740 | |||||||||||
| 4 | 985 | 2420 | 2080 | 720 | 80 | 6285 | ||||||||||
| 5 | 5418 | 16500 | 18960 | 10080 | 2400 | 192 | 53550 | |||||||||
| 6 | 29953 | 108822 | 156660 | 112840 | 42000 | 7392 | 448 | 458115 | ||||||||
| 7 | 166344 | 702016 | 1214976 | 1106560 | 564480 | 157696 | 21504 | 1024 | 3934600 | |||||||
| 8 | 927441 | 4458312 | 9015552 | 9938880 | 6463296 | 2499840 | 548352 | 59904 | 2304 | 33913881 | ||||||
| 9 | 5188590 | 27985860 | 64758240 | 83852160 | 66407040 | 32981760 | 10106880 | 1797120 | 161280 | 5120 | 293244050 | |||||
| 10 | 29113953 | 174107010 | 453712380 | 675050640 | 630907200 | 383703936 | 151979520 | 38058240 | 5617920 | 422400 | 11264 | 2542684463 | ||||
| 11 | 163786428 | 1075509072 | 3116900160 | 5240236320 | 5648860800 | 4071868416 | 1984840704 | 646272000 | 135336960 | 16896000 | 1081344 | 24576 | 22101612780 | |||
| 12 | 923511849 | 6605682876 | 21074223456 | 39512787600 | 48279900240 | 40280093568 | 23363738112 | 9405107712 | 2574823680 | 459064320 | 49201152 | 2715648 | 53248 | 192530903461 | ||
| 13 | 5217709266 | 40379693172 | 140628629232 | 290942652000 | 397481980896 | 376968656064 | 253888707072 | 122058832896 | 41487333888 | 9718252544 | 1496535040 | 139403264 | 6709248 | 114688 | 1680415209270 | |
| 14 | 29532022785 | 245856978990 | 928127605860 | 2100349382040 | 3173224214160 | 3372985455840 | 2589244257600 | 1449705628800 | 590471481600 | 172396224000 | 35040445440 | 4716042240 | 385781760 | 16343040 | 245760 | 14692052109915 |
Compute more
?
Technical details
- Node id
n-31a1b9b1779ea532· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-acc791d1c44ba380
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: 6, 4; 2: 33, 42, 12; 3: 180, 336, 192, 32; 4: 985, 2420, 2080, 720, 80; 5: 5418, 16500, 18960, 10080, 2400, 192; 6: 29953, 108822, 156660, 112840, 42000, 7392, 448; 7: 166344, 702016, 1214976, 1106560, 564480, 157696, 21504, 1024; 8: 927441, 4458312, 9015552, 9938880, 6463296, 2499840, 548352, 59904, 2304; 9: 5188590, 27985860, 64758240, 83852160, 66407040, 32981760, 10106880, 1797120, 161280, 5120;
%F FormulaThe row polynomials satisfy (n^2+2*n)*P(n,x) = -(n^2+n+(4*n^2+4*n)*x+(4*n^2+4*n)*x^2)*P(n-2,x) + (6*n^2+9*n+3+(4*n^2+6*n+2)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 6 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^2 + n + (4*n^2 + 4*n)*x + (4*n^2 + 4*n)*x^2)*P[n - 2, x] + (6*n^2 + 9*n + 3 + (4*n^2 + 6*n + 2)*x)*P[n - 1, x])/(n^2 + 2*n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 6 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^2 + n + (4*n^2 + 4*n)*x + (4*n^2 + 4*n)*x^2)*v[i - 2] + (6*n^2 + 9*n + 3 + (4*n^2 + 6*n + 2)*x)*v[i - 1])/(n^2 + 2*n)); 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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, 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 ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
narayana?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
narayana?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
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>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
-
from
basis-map coefficients of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
from
Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
-
-
from
shift_x_plus_one of Triangle read by rows, n>=1, 1<=k<=n, T(n,k) = k*binomial(n,k)^2/(n-k+1).?
Related ?
Same fingerprint ?
- A114656 → x ↦ x/(x+1)
- A114655 → x ↦ x/(x+1)
- A114687 → basis A007318
- A114687 → reverse → x ↦ x/(x+1)
- A114656 → reverse → x ↦ x+1
- A114687 → basis A007318 → reverse
- A114655 → reverse → x ↦ x+1
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