A030528 → basis A013611 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(52 - 464\,x - 576\,x^{2} + 256\,x^{3} - 188\,n - 592\,n x - 320\,n x^{2} + 256\,n x^{3} - 176\,n^{2} - 128\,n^{2} x + 256\,n^{2} x^{2} + 64\,n^{3}\right)\,P_{n}(x) = \left(216 - 5056\,x - 7680\,x^{2} - 1024\,x^{3} + 2048\,x^{4} - 2824\,n - 4320\,n x - 384\,n x^{2} + 1536\,n x^{3} + 1248\,n^{2} + 1280\,n^{2} x - 512\,n^{2} x^{2} - 128\,n^{3}\right)\,P_{n-1}(x) + \left(25 - 460\,x - 2784\,x^{2} - 1920\,x^{3} + 1280\,x^{4} + 1024\,x^{5} - 300\,n - 1600\,n x - 1408\,n x^{2} + 1024\,n x^{3} + 1024\,n x^{4} + 80\,n^{2} + 384\,n^{2} x + 256\,n^{2} x^{2}\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 | 6 | 4 | 10 | |||||||||||||
| 2 | 19 | 48 | 16 | 83 | ||||||||||||
| 3 | 45 | 232 | 288 | 64 | 629 | |||||||||||
| 4 | 96 | 760 | 1872 | 1536 | 256 | 4520 | ||||||||||
| 5 | 193 | 2068 | 7856 | 12544 | 7680 | 1024 | 31365 | |||||||||
| 6 | 373 | 5056 | 26160 | 64256 | 75520 | 36864 | 4096 | 212325 | ||||||||
| 7 | 702 | 11516 | 75696 | 253824 | 456960 | 423936 | 172032 | 16384 | 1411050 | |||||||
| 8 | 1295 | 24952 | 199248 | 850944 | 2091520 | 2959360 | 2265088 | 786432 | 65536 | 9244375 | ||||||
| 9 | 2353 | 52088 | 489936 | 2548096 | 7986432 | 15412224 | 17920000 | 11665408 | 3538944 | 262144 | 59877625 | |||||
| 10 | 4224 | 105648 | 1144416 | 7025664 | 26855680 | 66109440 | 104681472 | 103153664 | 58392576 | 15728640 | 1048576 | 384250000 | ||||
| 11 | 7509 | 209420 | 2568080 | 18189376 | 82191360 | 246952960 | 498692096 | 668139520 | 570753024 | 285736960 | 69206016 | 4194304 | 2446840625 | |||
| 12 | 13241 | 407424 | 5580192 | 44812544 | 233935360 | 831682560 | 2050592768 | 3501719552 | 4060348416 | 3059220480 | 1372585984 | 301989888 | 16777216 | 15479665625 | ||
| 13 | 23190 | 780404 | 11809056 | 106061568 | 628519680 | 2583966720 | 7542779904 | 15726739456 | 23225499648 | 23714856960 | 15975055360 | 6492782592 | 1308622848 | 67108864 | 97384606250 | |
| 14 | 40379 | 1475328 | 24445328 | 242848512 | 1611221248 | 7526379520 | 25422917632 | 62774312960 | 113167368192 | 147048103936 | 134040518656 | 81621155840 | 30316429312 | 5637144576 | 268435456 | 609702796875 |
Compute more
?
Technical details
- Node id
n-7c37fc732e912755· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-8bbee996c5ae4546
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: 19, 48, 16; 3: 45, 232, 288, 64; 4: 96, 760, 1872, 1536, 256; 5: 193, 2068, 7856, 12544, 7680, 1024; 6: 373, 5056, 26160, 64256, 75520, 36864, 4096; 7: 702, 11516, 75696, 253824, 456960, 423936, 172032, 16384; 8: 1295, 24952, 199248, 850944, 2091520, 2959360, 2265088, 786432, 65536; 9: 2353, 52088, 489936, 2548096, 7986432, 15412224, 17920000, 11665408, 3538944, 262144;
%F FormulaThe row polynomials satisfy (64*n^3-176*n^2-188*n+52-(128*n^2+592*n+464)*x+(256*n^2-320*n-576)*x^2+(256*n+256)*x^3)*P(n,x) = -(128*n^3-1248*n^2+2824*n-216-(1280*n^2-4320*n-5056)*x+(512*n^2+384*n+7680)*x^2-(1536*n-1024)*x^3-2048*x^4)*P(n-1,x) + (80*n^2-300*n+25+(384*n^2-1600*n-460)*x+(256*n^2-1408*n-2784)*x^2+(1024*n-1920)*x^3+(1024*n+1280)*x^4+1024*x^5)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(128*n^3 - 1248*n^2 + 2824*n - 216 - (1280*n^2 - 4320*n - 5056)*x + (512*n^2 + 384*n + 7680)*x^2 - (1536*n - 1024)*x^3 - 2048*x^4)*P[n - 1, x] + (80*n^2 - 300*n + 25 + (384*n^2 - 1600*n - 460)*x + (256*n^2 - 1408*n - 2784)*x^2 + (1024*n - 1920)*x^3 + (1024*n + 1280)*x^4 + 1024*x^5)*D[P[n - 1, x], x])/(64*n^3 - 176*n^2 - 188*n + 52 - (128*n^2 + 592*n + 464)*x + (256*n^2 - 320*n - 576)*x^2 + (256*n + 256)*x^3)]];
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] = (-(128*n^3 - 1248*n^2 + 2824*n - 216 - (1280*n^2 - 4320*n - 5056)*x + (512*n^2 + 384*n + 7680)*x^2 - (1536*n - 1024)*x^3 - 2048*x^4)*v[i - 1] + (80*n^2 - 300*n + 25 + (384*n^2 - 1600*n - 460)*x + (256*n^2 - 1408*n - 2784)*x^2 + (1024*n - 1920)*x^3 + (1024*n + 1280)*x^4 + 1024*x^5)*deriv(v[i - 1], x))/(64*n^3 - 176*n^2 - 188*n + 52 - (128*n^2 + 592*n + 464)*x + (256*n^2 - 320*n - 576)*x^2 + (256*n + 256)*x^3)); 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_A013611 of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Ma–Wang interval theorem (above)
-
from
Triangle read by rows: T(n,k) = binomial(k,n-k).?
-
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) = binomial(k,n-k).?
References
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.