A059364 → basis A013611 → reverse
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(x + 4\,n + 2\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 4 | 3 | 7 | |||||||||||||
| 2 | 32 | 44 | 15 | 91 | ||||||||||||
| 3 | 384 | 752 | 488 | 105 | 1729 | |||||||||||
| 4 | 6144 | 15488 | 14576 | 6072 | 945 | 43225 | ||||||||||
| 5 | 122880 | 377344 | 461888 | 281776 | 85692 | 10395 | 1339975 | |||||||||
| 6 | 2949120 | 10653696 | 15990784 | 12767168 | 5719696 | 1363476 | 135135 | 49579075 | ||||||||
| 7 | 82575360 | 342540288 | 607547392 | 597342464 | 351659008 | 123972768 | 24235920 | 2027025 | 2131900225 | |||||||
| 8 | 2642411520 | 12365070336 | 25264701440 | 29443264512 | 21407910144 | 9945331712 | 2883086496 | 476875440 | 34459425 | 104463111025 | ||||||
| 9 | 95126814720 | 495348350976 | 1144465588224 | 1539986849792 | 1330106790912 | 764782234368 | 292752416384 | 71946159264 | 10301172660 | 654729075 | 5745471106375 | |||||
| 10 | 3805072588800 | 21811597148160 | 56180938899456 | 85633251344384 | 85543995482112 | 58523531983872 | 27770523577088 | 9025647114624 | 1922916250944 | 242513788860 | 13749310575 | 350473737488875 | ||||
| 11 | 167423193907200 | 1047226944061440 | 2973628045983744 | 5060024653840384 | 5733500582133760 | 4542547303378944 | 2567944273020928 | 1035850515316480 | 292198198677888 | 54897680481552 | 6182786809080 | 316234143225 | 23481740411754625 | |||
| 12 | 8036313307545600 | 54452473162629120 | 168914819808755712 | 317221884533932032 | 401708644288430080 | 361379785115533312 | 236825007689478144 | 113919431560714240 | 39921776419450624 | 9940043630061696 | 1669215778874640 | 169748909101800 | 7905853580625 | 1714167050058087625 | ||
| 13 | 417888291992371200 | 3048509063760445440 | 10253787405446283264 | 21056238130600869888 | 29453840385414529024 | 29637882221795344384 | 22072154597972262912 | 12318085648773050368 | 5151757025950716928 | 1594770232088375040 | 355180398513147072 | 53895769302908880 | 4994324931941100 | 213458046676875 | 135419196954588922375 | |
| 14 | 23401744351572787200 | 182835268038363709440 | 662618857554044780544 | 1476509170071590928384 | 2260045967370638852096 | 2513882775597560627200 | 2095539241918511710208 | 1329905279672486445056 | 645722877267658608640 | 238708086749519793152 | 66138439047299112192 | 13318394637844162368 | 1842659505973059120 | 156789073640196900 | 6190283353629375 | 11510631741140058401875 |
Compute more
?
Technical details
- Node id
n-75656e7178d4d4e4· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-a039d5598c7c2c03
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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 4, 3; 2: 32, 44, 15; 3: 384, 752, 488, 105; 4: 6144, 15488, 14576, 6072, 945; 5: 122880, 377344, 461888, 281776, 85692, 10395; 6: 2949120, 10653696, 15990784, 12767168, 5719696, 1363476, 135135; 7: 82575360, 342540288, 607547392, 597342464, 351659008, 123972768, 24235920, 2027025; 8: 2642411520, 12365070336, 25264701440, 29443264512, 21407910144, 9945331712, 2883086496, 476875440, 34459425; 9: 95126814720, 495348350976, 1144465588224, 1539986849792, 1330106790912, 764782234368, 292752416384, 71946159264, 10301172660, 654729075;
%F FormulaThe row polynomials satisfy P(n,x) = (4*n+(2*n+1)*x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4*n + (2*n + 1)*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (4*n + (2*n + 1)*x)*v[i - 1]); 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
- 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
basis_map_A013611 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
-
from
basis_map_A013611 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
Related ?
Same fingerprint ?
References
- [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
- [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.