A064861 → x ↦ x+1 → D
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(8 + 4\,x + 57\,n + 60\,n x + 16\,n x^{2} + 49\,n^{2} + 56\,n^{2} x + 16\,n^{2} x^{2}\right)\,P_{n}(x) = \left(28 + 30\,x + 8\,x^{2} + 1460\,n + 3235\,n x + 2660\,n x^{2} + 960\,n x^{3} + 128\,n x^{4} + 1463\,n^{2} + 3580\,n^{2} x + 3248\,n^{2} x^{2} + 1296\,n^{2} x^{3} + 192\,n^{2} x^{4} + 343\,n^{3} + 931\,n^{3} x + 924\,n^{3} x^{2} + 400\,n^{3} x^{3} + 64\,n^{3} x^{4}\right)\,P_{n-1}(x) + \left(-1968 - 5776\,x - 6732\,x^{2} - 3896\,x^{3} - 1120\,x^{4} - 128\,x^{5} - 2268\,n - 7050\,n x - 8678\,n x^{2} - 5292\,n x^{3} - 1600\,n x^{4} - 192\,n x^{5} - 588\,n^{2} - 1946\,n^{2} x - 2530\,n^{2} x^{2} - 1620\,n^{2} x^{3} - 512\,n^{2} x^{4} - 64\,n^{2} x^{5}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 7 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | x15 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 7 | 4 | 11 | ||||||||||||||
| 1 | 33 | 40 | 12 | 85 | |||||||||||||
| 2 | 84 | 146 | 84 | 16 | 330 | ||||||||||||
| 3 | 324 | 774 | 690 | 272 | 40 | 2100 | |||||||||||
| 4 | 756 | 2196 | 2541 | 1464 | 420 | 48 | 7425 | ||||||||||
| 5 | 2700 | 9612 | 14211 | 11168 | 4920 | 1152 | 112 | 43875 | |||||||||
| 6 | 6048 | 24624 | 42840 | 41284 | 23800 | 8208 | 1568 | 128 | 148500 | ||||||||
| 7 | 20736 | 98064 | 202392 | 238092 | 174610 | 81744 | 23856 | 3968 | 288 | 843750 | |||||||
| 8 | 45360 | 237600 | 551880 | 746040 | 646835 | 373020 | 143080 | 35200 | 5040 | 320 | 2784375 | ||||||
| 9 | 151632 | 894240 | 2368440 | 3709800 | 3805605 | 2671464 | 1299620 | 432640 | 94320 | 12160 | 704 | 15440625 | |||||
| 10 | 326592 | 2091744 | 6078240 | 10577520 | 12248460 | 9909654 | 5715948 | 2350560 | 675360 | 129120 | 14784 | 768 | 50118750 | ||||
| 11 | 1073088 | 7581600 | 24509952 | 47941200 | 63189180 | 59125266 | 40270370 | 20116704 | 7314840 | 1888160 | 328416 | 34560 | 1664 | 273375000 | |||
| 12 | 2286144 | 17309376 | 60392304 | 128562336 | 186304860 | 194077548 | 149520217 | 86256688 | 37260972 | 11903920 | 2733808 | 427392 | 40768 | 1792 | 877078125 | ||
| 13 | 7418304 | 61072704 | 233105040 | 546733152 | 880320420 | 1029364308 | 901408263 | 600530560 | 305860464 | 118513920 | 34390048 | 7246848 | 1048320 | 93184 | 3840 | 4727109375 | |
| 14 | 15676416 | 136982016 | 557819136 | 1404273024 | 2444057280 | 3115113120 | 3003741552 | 2231241992 | 1287317808 | 576872800 | 199145408 | 52010112 | 9947392 | 1315328 | 107520 | 4096 | 15035625000 |
Compute more
?
Technical details
- Node id
n-7a412f8307bbe357· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-88e2a299ce8e2b61
Observed on the stored rows ?
- Degrees: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15 (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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 7, 4; 1: 33, 40, 12; 2: 84, 146, 84, 16; 3: 324, 774, 690, 272, 40; 4: 756, 2196, 2541, 1464, 420, 48; 5: 2700, 9612, 14211, 11168, 4920, 1152, 112; 6: 6048, 24624, 42840, 41284, 23800, 8208, 1568, 128; 7: 20736, 98064, 202392, 238092, 174610, 81744, 23856, 3968, 288; 8: 45360, 237600, 551880, 746040, 646835, 373020, 143080, 35200, 5040, 320; 9: 151632, 894240, 2368440, 3709800, 3805605, 2671464, 1299620, 432640, 94320, 12160, 704;
%F FormulaThe row polynomials satisfy (49*n^2+57*n+8+(56*n^2+60*n+4)*x+(16*n^2+16*n)*x^2)*P(n,x) = (343*n^3+1463*n^2+1460*n+28+(931*n^3+3580*n^2+3235*n+30)*x+(924*n^3+3248*n^2+2660*n+8)*x^2+(400*n^3+1296*n^2+960*n)*x^3+(64*n^3+192*n^2+128*n)*x^4)*P(n-1,x) - (588*n^2+2268*n+1968+(1946*n^2+7050*n+5776)*x+(2530*n^2+8678*n+6732)*x^2+(1620*n^2+5292*n+3896)*x^3+(512*n^2+1600*n+1120)*x^4+(64*n^2+192*n+128)*x^5)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 7 + 4*x.
%t MathematicaP[0, x_] := 7 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[((343*n^3 + 1463*n^2 + 1460*n + 28 + (931*n^3 + 3580*n^2 + 3235*n + 30)*x + (924*n^3 + 3248*n^2 + 2660*n + 8)*x^2 + (400*n^3 + 1296*n^2 + 960*n)*x^3 + (64*n^3 + 192*n^2 + 128*n)*x^4)*P[n - 1, x] - (588*n^2 + 2268*n + 1968 + (1946*n^2 + 7050*n + 5776)*x + (2530*n^2 + 8678*n + 6732)*x^2 + (1620*n^2 + 5292*n + 3896)*x^3 + (512*n^2 + 1600*n + 1120)*x^4 + (64*n^2 + 192*n + 128)*x^5)*D[P[n - 1, x], x])/(49*n^2 + 57*n + 8 + (56*n^2 + 60*n + 4)*x + (16*n^2 + 16*n)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 7 + 4*x; for(n = 1, N, my(i = n + 1); v[i] = ((343*n^3 + 1463*n^2 + 1460*n + 28 + (931*n^3 + 3580*n^2 + 3235*n + 30)*x + (924*n^3 + 3248*n^2 + 2660*n + 8)*x^2 + (400*n^3 + 1296*n^2 + 960*n)*x^3 + (64*n^3 + 192*n^2 + 128*n)*x^4)*v[i - 1] - (588*n^2 + 2268*n + 1968 + (1946*n^2 + 7050*n + 5776)*x + (2530*n^2 + 8678*n + 6732)*x^2 + (1620*n^2 + 5292*n + 3896)*x^3 + (512*n^2 + 1600*n + 1120)*x^4 + (64*n^2 + 192*n + 128)*x^5)*deriv(v[i - 1], x))/(49*n^2 + 57*n + 8 + (56*n^2 + 60*n + 4)*x + (16*n^2 + 16*n)*x^2)); 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 Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A007318 of Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
-
from
Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a(n-1,k) for n+k odd.?
-
-
from
basis_map_A007318 of Triangle of Sulanke numbers: T(n,k) = T(n,k-1) + a(n-1,k) for n+k even and a(n,k) = a(n,k-1) + 2*a…?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.