A131431 → θ+1 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(10 - 21\,n + 9\,n^{2}\right)\,P_{n}(x) = \left(2 + 6\,x + 2\,x^{2} + 3\,n + 9\,n x + 3\,n x^{2} - 9\,n^{2} - 27\,n^{2} x - 9\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(6\,x + 4\,x^{2} + 9\,n x + 6\,n x^{2} - 27\,n^{2} x - 18\,n^{2} x^{2}\right)\,P_{n-2}'(x) + \left(2\,x^{2} + 3\,n x^{2} - 9\,n^{2} x^{2}\right)\,P_{n-2}''(x) + \left(-10 - 10\,x - 24\,n - 24\,n x + 18\,n^{2} + 18\,n^{2} x\right)\,P_{n-1}(x) + \left(-10\,x - 24\,n x + 18\,n^{2} x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 8 + 8\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 8 | 8 | 16 | |||||||||||||
| 2 | 21 | 63 | 21 | 105 | ||||||||||||
| 3 | 40 | 280 | 240 | 40 | 600 | |||||||||||
| 4 | 65 | 975 | 1625 | 650 | 65 | 3380 | ||||||||||
| 5 | 96 | 2976 | 8640 | 6240 | 1440 | 96 | 19488 | |||||||||
| 6 | 133 | 8379 | 40033 | 46550 | 18620 | 2793 | 133 | 116641 | ||||||||
| 7 | 176 | 22352 | 170016 | 299376 | 184800 | 46816 | 4928 | 176 | 728640 | |||||||
| 8 | 225 | 57375 | 680625 | 1748250 | 1563975 | 595350 | 103950 | 8100 | 225 | 4758075 | ||||||
| 9 | 280 | 143080 | 2612400 | 9549400 | 11907000 | 6391560 | 1646400 | 210000 | 12600 | 280 | 32473000 | |||||
| 10 | 341 | 348843 | 9718841 | 49700750 | 84134930 | 61205067 | 21819567 | 4051080 | 393855 | 18755 | 341 | 231392370 | ||||
| 11 | 408 | 835176 | 35302608 | 249492408 | 562795200 | 540050016 | 255977568 | 64883016 | 9088200 | 695640 | 26928 | 408 | 1719147576 | |||
| 12 | 481 | 1969695 | 125841625 | 1218146930 | 3611588981 | 4483551072 | 2749118944 | 913713372 | 172920462 | 18915325 | 1169311 | 37518 | 481 | 13296974197 | ||
| 13 | 560 | 4586960 | 441823200 | 5819377200 | 22442019600 | 35524368880 | 27624396800 | 11710899200 | 2875672800 | 421541120 | 36996960 | 1885520 | 50960 | 560 | 106903620320 | |
| 14 | 645 | 10567035 | 1531940145 | 27319587750 | 135944663400 | 271347161085 | 263638159785 | 139724956800 | 43297876050 | 8167409250 | 954263310 | 68673150 | 2934750 | 67725 | 645 | 892008261525 |
Compute more
?
Technical details
- Node id
n-2a2bde98ff098755· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-4732d0911d5a78c5
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: 8, 8; 2: 21, 63, 21; 3: 40, 280, 240, 40; 4: 65, 975, 1625, 650, 65; 5: 96, 2976, 8640, 6240, 1440, 96; 6: 133, 8379, 40033, 46550, 18620, 2793, 133; 7: 176, 22352, 170016, 299376, 184800, 46816, 4928, 176; 8: 225, 57375, 680625, 1748250, 1563975, 595350, 103950, 8100, 225; 9: 280, 143080, 2612400, 9549400, 11907000, 6391560, 1646400, 210000, 12600, 280;
%F FormulaThe row polynomials satisfy (9*n^2-21*n+10)*P(n,x) = -(9*n^2-3*n-2+(27*n^2-9*n-6)*x+(9*n^2-3*n-2)*x^2)*P(n-2,x) - ((27*n^2-9*n-6)*x+(18*n^2-6*n-4)*x^2)*d/dx P(n-2,x) - (9*n^2-3*n-2)*x^2*d^2/dx^2 P(n-2,x) + (18*n^2-24*n-10+(18*n^2-24*n-10)*x)*P(n-1,x) + (18*n^2-24*n-10)*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 8 + 8*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 8 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(9*n^2 - 3*n - 2 + (27*n^2 - 9*n - 6)*x + (9*n^2 - 3*n - 2)*x^2)*P[n - 2, x] - ((27*n^2 - 9*n - 6)*x + (18*n^2 - 6*n - 4)*x^2)*D[P[n - 2, x], x] - (9*n^2 - 3*n - 2)*x^2*D[P[n - 2, x], {x, 2}] + (18*n^2 - 24*n - 10 + (18*n^2 - 24*n - 10)*x)*P[n - 1, x] + (18*n^2 - 24*n - 10)*x*D[P[n - 1, x], x])/(9*n^2 - 21*n + 10)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 8 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (-(9*n^2 - 3*n - 2 + (27*n^2 - 9*n - 6)*x + (9*n^2 - 3*n - 2)*x^2)*v[i - 2] - ((27*n^2 - 9*n - 6)*x + (18*n^2 - 6*n - 4)*x^2)*deriv(v[i - 2], x) - (9*n^2 - 3*n - 2)*x^2*deriv(deriv(v[i - 2], x), x) + (18*n^2 - 24*n - 10 + (18*n^2 - 24*n - 10)*x)*v[i - 1] + (18*n^2 - 24*n - 10)*x*deriv(v[i - 1], x))/(9*n^2 - 21*n + 10)); 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 Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
theta_plus_one of 3n + 1 preceded by n zeros.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
3n + 1 preceded by n zeros.?
-
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)
-
Geometric basis map (elementary) polytool ? step ›
-
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.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
3n + 1 preceded by n zeros.?
-
-
from
theta_plus_one of 3n + 1 preceded by n zeros.?
Related ?
Same fingerprint ?
- image under θ+1 → basis A008277
- A136572 → D → basis A008277
- basis-map coefficients of A026729, shifted → θ+1 → basis A008277
- basis-map coefficients of A021012 → basis A008277 → reverse
- A136521 → basis A008277
- basis-map coefficients of A026729, shifted → (θ+1)² → basis A008277
- basis-map coefficients of A021012 → θ+1 → basis A008277
- A130123 → basis A008277 → reverse
- basis-map coefficients of A026729 → D → basis A008277
- A048993 → reverse
- A131431 → D → basis A008277
- basis-map coefficients of A030528, shifted → θ+1 → basis A008277
- basis-map coefficients of A026729 → (θ+1)² → basis A008277
- basis-map coefficients of A030528, shifted → D → basis A008277
- A134309 → basis A008277
- A130123 → θ+1 → basis A008277
- A127648 → D → basis A008277
- image under θ+1 → θ+1 → D → basis A008277
- A048993: Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.
- basis-map coefficients of A112227 → basis A008277
- A136572 → (θ+1)² → basis A008277
- basis-map coefficients of A112227 → θ+1 → basis A008277
- A131431 → basis A008277
- basis-map coefficients of A030528, shifted → basis A008277
- A136572 → θ+1 → basis A008277
- A048993 → D+1
- A132440 → θ+1 → basis A008277
- basis-map coefficients of A026729, shifted → basis A008277
- A106800: Triangle of Stirling numbers of 2nd kind, S(n, n-k), n >= 0, 0 <= k <= n.
- A129186 → basis A008277
- A132440 → basis A008277
- A130123 → basis A008277
- basis-map coefficients of A112227 → (θ+1)² → basis A008277
- A131436 → basis A008277
- image under θ+1 → (θ+1)² → basis A008277
- A048993 → D+1 → reverse
- A136572 → basis A008277
- A008278: Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.
- A130123 → (θ+1)² → basis A008277
- A130123 → D → basis A008277
- basis-map coefficients of A026729, shifted → D → basis A008277
- basis-map coefficients of A030528, shifted → (θ+1)² → basis A008277
- A008277: Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
- basis-map coefficients of A112227 → basis A008277 → reverse
- basis-map coefficients of A021012 → basis A008277
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.