A127773 → D → D+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(144 - 156\,x + 54\,x^{2} - 6\,x^{3} - 420\,n + 394\,n x - 117\,n x^{2} + 11\,n x^{3} + 484\,n^{2} - 372\,n^{2} x + 87\,n^{2} x^{2} - 6\,n^{2} x^{3} - 285\,n^{3} + 167\,n^{3} x - 27\,n^{3} x^{2} + n^{3} x^{3} + 91\,n^{4} - 36\,n^{4} x + 3\,n^{4} x^{2} - 15\,n^{5} + 3\,n^{5} x + n^{6}\right)\,P_{n}(x) = \left(-12\,n x^{3} + 22\,n x^{4} - 12\,n x^{5} + 2\,n x^{6} + 40\,n^{2} x^{3} - 57\,n^{2} x^{4} + 24\,n^{2} x^{5} - 3\,n^{2} x^{6} - 51\,n^{3} x^{3} + 53\,n^{3} x^{4} - 15\,n^{3} x^{5} + n^{3} x^{6} + 31\,n^{4} x^{3} - 21\,n^{4} x^{4} + 3\,n^{4} x^{5} - 9\,n^{5} x^{3} + 3\,n^{5} x^{4} + n^{6} x^{3}\right)\,P_{n-3}(x) + \left(72\,n x^{2} - 126\,n x^{3} + 63\,n x^{4} - 9\,n x^{5} - 222\,n^{2} x^{2} + 294\,n^{2} x^{3} - 111\,n^{2} x^{4} + 12\,n^{2} x^{5} + 255\,n^{3} x^{2} - 237\,n^{3} x^{3} + 57\,n^{3} x^{4} - 3\,n^{3} x^{5} - 135\,n^{4} x^{2} + 78\,n^{4} x^{3} - 9\,n^{4} x^{4} + 33\,n^{5} x^{2} - 9\,n^{5} x^{3} - 3\,n^{6} x^{2}\right)\,P_{n-2}(x) + \left(-216\,n x + 342\,n x^{2} - 144\,n x^{3} + 18\,n x^{4} + 522\,n^{2} x - 573\,n^{2} x^{2} + 174\,n^{2} x^{3} - 15\,n^{2} x^{4} - 465\,n^{3} x + 351\,n^{3} x^{2} - 69\,n^{3} x^{3} + 3\,n^{3} x^{4} + 195\,n^{4} x - 93\,n^{4} x^{2} + 9\,n^{4} x^{3} - 39\,n^{5} x + 9\,n^{5} x^{2} + 3\,n^{6} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 3\)
\(P_{2}(x) = 12 + 12\,x\)
\(P_{3}(x) = 60\,x + 30\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 3 | 3 | |||||||||||||
| 2 | 12 | 12 | 24 | ||||||||||||
| 3 | 0 | 60 | 30 | 90 | |||||||||||
| 4 | 0 | 0 | 180 | 60 | 240 | ||||||||||
| 5 | 0 | 0 | 0 | 420 | 105 | 525 | |||||||||
| 6 | 0 | 0 | 0 | 0 | 840 | 168 | 1008 | ||||||||
| 7 | 0 | 0 | 0 | 0 | 0 | 1512 | 252 | 1764 | |||||||
| 8 | 0 | 0 | 0 | 0 | 0 | 0 | 2520 | 360 | 2880 | ||||||
| 9 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 3960 | 495 | 4455 | |||||
| 10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 5940 | 660 | 6600 | ||||
| 11 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 8580 | 858 | 9438 | |||
| 12 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 12012 | 1092 | 13104 | ||
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 16380 | 1365 | 17745 | |
| 14 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 21840 | 1680 | 23520 |
Compute more
?
Technical details
- Node id
n-4f63621ddd1bfac6· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-2327141074f67bdf
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (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: 0; 1: 3; 2: 12, 12; 3: 0, 60, 30; 4: 0, 0, 180, 60; 5: 0, 0, 0, 420, 105; 6: 0, 0, 0, 0, 840, 168; 7: 0, 0, 0, 0, 0, 1512, 252; 8: 0, 0, 0, 0, 0, 0, 2520, 360; 9: 0, 0, 0, 0, 0, 0, 0, 3960, 495;
%F FormulaThe row polynomials satisfy (n^6-15*n^5+91*n^4-285*n^3+484*n^2-420*n+144+(3*n^5-36*n^4+167*n^3-372*n^2+394*n-156)*x+(3*n^4-27*n^3+87*n^2-117*n+54)*x^2+(n^3-6*n^2+11*n-6)*x^3)*P(n,x) = ((n^6-9*n^5+31*n^4-51*n^3+40*n^2-12*n)*x^3+(3*n^5-21*n^4+53*n^3-57*n^2+22*n)*x^4+(3*n^4-15*n^3+24*n^2-12*n)*x^5+(n^3-3*n^2+2*n)*x^6)*P(n-3,x) - ((3*n^6-33*n^5+135*n^4-255*n^3+222*n^2-72*n)*x^2+(9*n^5-78*n^4+237*n^3-294*n^2+126*n)*x^3+(9*n^4-57*n^3+111*n^2-63*n)*x^4+(3*n^3-12*n^2+9*n)*x^5)*P(n-2,x) + ((3*n^6-39*n^5+195*n^4-465*n^3+522*n^2-216*n)*x+(9*n^5-93*n^4+351*n^3-573*n^2+342*n)*x^2+(9*n^4-69*n^3+174*n^2-144*n)*x^3+(3*n^3-15*n^2+18*n)*x^4)*P(n-1,x) for n >= 4, with P(0,x) = 0, P(1,x) = 3, P(2,x) = 12 + 12*x, P(3,x) = 60*x + 30*x^2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 3;
P[2, x_] := 12 + 12*x;
P[3, x_] := 60*x + 30*x^2;
P[n_, x_] := P[n, x] = Expand[Together[(((n^6 - 9*n^5 + 31*n^4 - 51*n^3 + 40*n^2 - 12*n)*x^3 + (3*n^5 - 21*n^4 + 53*n^3 - 57*n^2 + 22*n)*x^4 + (3*n^4 - 15*n^3 + 24*n^2 - 12*n)*x^5 + (n^3 - 3*n^2 + 2*n)*x^6)*P[n - 3, x] - ((3*n^6 - 33*n^5 + 135*n^4 - 255*n^3 + 222*n^2 - 72*n)*x^2 + (9*n^5 - 78*n^4 + 237*n^3 - 294*n^2 + 126*n)*x^3 + (9*n^4 - 57*n^3 + 111*n^2 - 63*n)*x^4 + (3*n^3 - 12*n^2 + 9*n)*x^5)*P[n - 2, x] + ((3*n^6 - 39*n^5 + 195*n^4 - 465*n^3 + 522*n^2 - 216*n)*x + (9*n^5 - 93*n^4 + 351*n^3 - 573*n^2 + 342*n)*x^2 + (9*n^4 - 69*n^3 + 174*n^2 - 144*n)*x^3 + (3*n^3 - 15*n^2 + 18*n)*x^4)*P[n - 1, x])/(n^6 - 15*n^5 + 91*n^4 - 285*n^3 + 484*n^2 - 420*n + 144 + (3*n^5 - 36*n^4 + 167*n^3 - 372*n^2 + 394*n - 156)*x + (3*n^4 - 27*n^3 + 87*n^2 - 117*n + 54)*x^2 + (n^3 - 6*n^2 + 11*n - 6)*x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 3; v[3] = 12 + 12*x; v[4] = 60*x + 30*x^2; for(n = 4, N, my(i = n + 1); v[i] = (((n^6 - 9*n^5 + 31*n^4 - 51*n^3 + 40*n^2 - 12*n)*x^3 + (3*n^5 - 21*n^4 + 53*n^3 - 57*n^2 + 22*n)*x^4 + (3*n^4 - 15*n^3 + 24*n^2 - 12*n)*x^5 + (n^3 - 3*n^2 + 2*n)*x^6)*v[i - 3] - ((3*n^6 - 33*n^5 + 135*n^4 - 255*n^3 + 222*n^2 - 72*n)*x^2 + (9*n^5 - 78*n^4 + 237*n^3 - 294*n^2 + 126*n)*x^3 + (9*n^4 - 57*n^3 + 111*n^2 - 63*n)*x^4 + (3*n^3 - 12*n^2 + 9*n)*x^5)*v[i - 2] + ((3*n^6 - 39*n^5 + 195*n^4 - 465*n^3 + 522*n^2 - 216*n)*x + (9*n^5 - 93*n^4 + 351*n^3 - 573*n^2 + 342*n)*x^2 + (9*n^4 - 69*n^3 + 174*n^2 - 144*n)*x^3 + (3*n^3 - 15*n^2 + 18*n)*x^4)*v[i - 1])/(n^6 - 15*n^5 + 91*n^4 - 285*n^3 + 484*n^2 - 420*n + 144 + (3*n^5 - 36*n^4 + 167*n^3 - 372*n^2 + 394*n - 156)*x + (3*n^4 - 27*n^3 + 87*n^2 - 117*n + 54)*x^2 + (n^3 - 6*n^2 + 11*n - 6)*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
derivative of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Even-numbered rows of Pascal's triangle.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Even-numbered rows of Pascal's triangle.?
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (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
Even-numbered rows of Pascal's triangle.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Even-numbered rows of Pascal's triangle.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Veronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
-
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 ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
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
Riordan array (1-x,x/(1-x)).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Iterated real-rootedness preservers (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Iterated real-rootedness preservers (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Gamma criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Parent-row provers of polytool (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
- ↑ Ray basis map theorem (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Veronese sections of Pólya frequency sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
a(n) = 1 if n is a triangular number, otherwise 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
-
from
basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
-
from
derivative of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
Related ?
Same fingerprint ?
- basis-map coefficients of A026729, shifted → θ+1 → D+1
- basis-map coefficients of A030528, shifted → (θ+1)² → D+1
- A130123 → θ+1 → D+1
- A136572 → D+1
- basis-map coefficients of A030528, shifted → D+1
- A127773 → D+1
- A132440 → D+1
- A131436 → D+1
- A136572 → (θ+1)² → D+1
- image under θ+1 → θ+1 → D+1 → reverse
- basis-map coefficients of A030528, shifted → θ+1 → D+1
- Hadamard-factor parent of A127773 → D+1
- A131431 → D+1
- A131431 → θ+1 → D+1
- A132440 → θ+1 → D+1
- A131431 → (θ+1)² → D+1
- basis-map coefficients of A026729 → D → D+1
- A136572 → D → D+1
- A127648 → D → D+1
- A127648 → (θ+1)² → D+1
- A131431 → D+1 → reverse
- basis-map coefficients of A021012 → D+1
- A136572 → θ+1 → D+1
- image under θ+1 → θ+1 → D+1
- basis-map coefficients of A026729 → D+1
- A023531 → D+1
- basis-map coefficients of A030528, shifted → D → D+1
- A127773 → θ+1 → D+1
- A131431 → D+1 → D
- A130123 → (θ+1)² → D+1
- image under θ+1 → D+1
- basis-map coefficients of A021012 → θ+1 → D+1
- basis-map coefficients of A026729, shifted → (θ+1)² → D+1
- basis-map coefficients of A026729, shifted → D+1
- A130123 → D+1
- image under θ+1 → (θ+1)² → D+1
- basis-map coefficients of A026729 → (θ+1)² → D+1
- basis-map coefficients of A026729, shifted → D → D+1
- A130123 → D → D+1
- image under θ+1 → θ+1 → D+1 → D
References
- [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [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
- [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
- [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.