A026729 → basis A013609 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(25 - 170\,x + 136\,x^{2} + 208\,x^{3} + 16\,x^{4} - 32\,x^{5} + 150\,n x - 440\,n x^{2} - 144\,n x^{3} + 224\,n x^{4} + 32\,n x^{5} + 240\,n^{2} x^{2} - 200\,n^{2} x^{3} - 208\,n^{2} x^{4} + 32\,n^{2} x^{5} + 120\,n^{3} x^{3} - 32\,n^{3} x^{5} + 16\,n^{4} x^{4}\right)\,P_{n}(x) = \left(25 + 30\,x - 104\,x^{2} - 144\,x^{3} + 16\,x^{4} + 96\,x^{5} + 150\,n x + 340\,n x^{2} - 104\,n x^{3} - 496\,n x^{4} - 256\,n x^{5} + 240\,n^{2} x^{2} + 640\,n^{2} x^{3} + 208\,n^{2} x^{4} - 288\,n^{2} x^{5} - 128\,n^{2} x^{6} + 120\,n^{3} x^{3} + 304\,n^{3} x^{4} + 96\,n^{3} x^{5} - 64\,n^{3} x^{6} + 16\,n^{4} x^{4} + 32\,n^{4} x^{5}\right)\,P_{n-2}(x) + \left(25 + 30\,x - 104\,x^{2} - 144\,x^{3} + 16\,x^{4} + 96\,x^{5} + 150\,n x + 200\,n x^{2} - 544\,n x^{3} - 768\,n x^{4} - 160\,n x^{5} + 240\,n^{2} x^{2} + 520\,n^{2} x^{3} - 96\,n^{2} x^{4} - 384\,n^{2} x^{5} - 64\,n^{2} x^{6} + 120\,n^{3} x^{3} + 272\,n^{3} x^{4} + 32\,n^{3} x^{5} - 64\,n^{3} x^{6} + 16\,n^{4} x^{4} + 32\,n^{4} x^{5}\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1 + 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 | 1 | 8 | 9 | |||||||||||||
| 3 | 2 | 24 | 36 | 62 | ||||||||||||
| 4 | 3 | 56 | 180 | 128 | 367 | |||||||||||
| 5 | 5 | 120 | 576 | 896 | 400 | 1997 | ||||||||||
| 6 | 8 | 240 | 1548 | 3712 | 3600 | 1152 | 10260 | |||||||||
| 7 | 13 | 464 | 3744 | 12160 | 18400 | 12672 | 3136 | 50589 | ||||||||
| 8 | 21 | 872 | 8460 | 34688 | 71600 | 77184 | 40768 | 8192 | 241785 | |||||||
| 9 | 34 | 1608 | 18216 | 90240 | 236400 | 349056 | 288512 | 122880 | 20736 | 1127682 | ||||||
| 10 | 55 | 2920 | 37836 | 219776 | 698400 | 1313280 | 1489600 | 991232 | 352512 | 51200 | 5156811 | |||||
| 11 | 89 | 5240 | 76428 | 509312 | 1903600 | 4354560 | 6303360 | 5758976 | 3193344 | 972800 | 123904 | 23201613 | ||||
| 12 | 144 | 9312 | 150984 | 1135360 | 4880400 | 13161600 | 23222080 | 27107328 | 20632320 | 9779200 | 2601984 | 294912 | 102975624 | |||
| 13 | 233 | 16416 | 292896 | 2453248 | 11923600 | 37054080 | 77208320 | 109993984 | 107018496 | 69580800 | 28745728 | 6782976 | 692224 | 451763001 | ||
| 14 | 377 | 28744 | 559656 | 5166848 | 28018400 | 98611200 | 237128640 | 399450112 | 474688512 | 394547200 | 223398912 | 81690624 | 17305600 | 1605632 | 1962200457 | |
| 15 | 610 | 50040 | 1055772 | 10651392 | 63754800 | 250698240 | 683648000 | 1330569216 | 1871237376 | 1900441600 | 1375334400 | 688619520 | 225665024 | 43352064 | 3686400 | 8448764454 |
Compute more
?
Technical details
- Node id
n-918d8c625e61ba01· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-8f4ac798ea66d40f
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: 1, 8; 3: 2, 24, 36; 4: 3, 56, 180, 128; 5: 5, 120, 576, 896, 400; 6: 8, 240, 1548, 3712, 3600, 1152; 7: 13, 464, 3744, 12160, 18400, 12672, 3136; 8: 21, 872, 8460, 34688, 71600, 77184, 40768, 8192; 9: 34, 1608, 18216, 90240, 236400, 349056, 288512, 122880, 20736; 10: 55, 2920, 37836, 219776, 698400, 1313280, 1489600, 991232, 352512, 51200;
%F FormulaThe row polynomials satisfy (25+(150*n-170)*x+(240*n^2-440*n+136)*x^2+(120*n^3-200*n^2-144*n+208)*x^3+(16*n^4-208*n^2+224*n+16)*x^4-(32*n^3-32*n^2-32*n+32)*x^5)*P(n,x) = (25+(150*n+30)*x+(240*n^2+340*n-104)*x^2+(120*n^3+640*n^2-104*n-144)*x^3+(16*n^4+304*n^3+208*n^2-496*n+16)*x^4+(32*n^4+96*n^3-288*n^2-256*n+96)*x^5-(64*n^3+128*n^2)*x^6)*P(n-2,x) + (25+(150*n+30)*x+(240*n^2+200*n-104)*x^2+(120*n^3+520*n^2-544*n-144)*x^3+(16*n^4+272*n^3-96*n^2-768*n+16)*x^4+(32*n^4+32*n^3-384*n^2-160*n+96)*x^5-(64*n^3+64*n^2)*x^6)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 8*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 1 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[((25 + (150*n + 30)*x + (240*n^2 + 340*n - 104)*x^2 + (120*n^3 + 640*n^2 - 104*n - 144)*x^3 + (16*n^4 + 304*n^3 + 208*n^2 - 496*n + 16)*x^4 + (32*n^4 + 96*n^3 - 288*n^2 - 256*n + 96)*x^5 - (64*n^3 + 128*n^2)*x^6)*P[n - 2, x] + (25 + (150*n + 30)*x + (240*n^2 + 200*n - 104)*x^2 + (120*n^3 + 520*n^2 - 544*n - 144)*x^3 + (16*n^4 + 272*n^3 - 96*n^2 - 768*n + 16)*x^4 + (32*n^4 + 32*n^3 - 384*n^2 - 160*n + 96)*x^5 - (64*n^3 + 64*n^2)*x^6)*P[n - 1, x])/(25 + (150*n - 170)*x + (240*n^2 - 440*n + 136)*x^2 + (120*n^3 - 200*n^2 - 144*n + 208)*x^3 + (16*n^4 - 208*n^2 + 224*n + 16)*x^4 - (32*n^3 - 32*n^2 - 32*n + 32)*x^5)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 8*x; for(n = 3, N, my(i = n); v[i] = ((25 + (150*n + 30)*x + (240*n^2 + 340*n - 104)*x^2 + (120*n^3 + 640*n^2 - 104*n - 144)*x^3 + (16*n^4 + 304*n^3 + 208*n^2 - 496*n + 16)*x^4 + (32*n^4 + 96*n^3 - 288*n^2 - 256*n + 96)*x^5 - (64*n^3 + 128*n^2)*x^6)*v[i - 2] + (25 + (150*n + 30)*x + (240*n^2 + 200*n - 104)*x^2 + (120*n^3 + 520*n^2 - 544*n - 144)*x^3 + (16*n^4 + 272*n^3 - 96*n^2 - 768*n + 16)*x^4 + (32*n^4 + 32*n^3 - 384*n^2 - 160*n + 96)*x^5 - (64*n^3 + 64*n^2)*x^6)*v[i - 1])/(25 + (150*n - 170)*x + (240*n^2 - 440*n + 136)*x^2 + (120*n^3 - 200*n^2 - 144*n + 208)*x^3 + (16*n^4 - 208*n^2 + 224*n + 16)*x^4 - (32*n^3 - 32*n^2 - 32*n + 32)*x^5)); 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 Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013609 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
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…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013609 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward ant…?
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
- [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.