image under θ+1 → (θ+1)² → basis A013610
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(n^{2} - 2\,n^{3} + n^{4}\right)\,P_{n}(x) = \left(-n^{2} - 6\,n^{2} x - 9\,n^{2} x^{2} - 2\,n^{3} - 12\,n^{3} x - 18\,n^{3} x^{2} - n^{4} - 6\,n^{4} x - 9\,n^{4} x^{2}\right)\,P_{n-2}(x) + \left(2 + 6\,x - 4\,n^{2} - 12\,n^{2} x + 2\,n^{4} + 6\,n^{4} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 8 + 24\,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 | 24 | 32 | |||||||||||||
| 2 | 27 | 162 | 243 | 432 | ||||||||||||
| 3 | 64 | 576 | 1728 | 1728 | 4096 | |||||||||||
| 4 | 125 | 1500 | 6750 | 13500 | 10125 | 32000 | ||||||||||
| 5 | 216 | 3240 | 19440 | 58320 | 87480 | 52488 | 221184 | |||||||||
| 6 | 343 | 6174 | 46305 | 185220 | 416745 | 500094 | 250047 | 1404928 | ||||||||
| 7 | 512 | 10752 | 96768 | 483840 | 1451520 | 2612736 | 2612736 | 1119744 | 8388608 | |||||||
| 8 | 729 | 17496 | 183708 | 1102248 | 4133430 | 9920232 | 14880348 | 12754584 | 4782969 | 47775744 | ||||||
| 9 | 1000 | 27000 | 324000 | 2268000 | 10206000 | 30618000 | 61236000 | 78732000 | 59049000 | 19683000 | 262144000 | |||||
| 10 | 1331 | 39930 | 539055 | 4312440 | 22640310 | 81505116 | 203762790 | 349307640 | 392971095 | 261980730 | 78594219 | 1395654656 | ||||
| 11 | 1728 | 57024 | 855360 | 7698240 | 46189440 | 193995648 | 581986944 | 1247114880 | 1870672320 | 1870672320 | 1122403392 | 306110016 | 7247757312 | |||
| 12 | 2197 | 79092 | 1305018 | 13050180 | 88088715 | 422825832 | 1479890412 | 3805432488 | 7135185915 | 9513581220 | 8562223098 | 4670303508 | 1167575877 | 36859543552 | ||
| 13 | 2744 | 107016 | 1926288 | 21189168 | 158918760 | 858161304 | 3432645216 | 10297935648 | 23170355208 | 38617258680 | 46340710416 | 37915126704 | 18957563352 | 4374822312 | 184146722816 | |
| 14 | 3375 | 141750 | 2764125 | 33169500 | 273648375 | 1641890250 | 7388506125 | 25332021000 | 66496555125 | 132993110250 | 199489665375 | 217625089500 | 163218817125 | 75331761750 | 16142520375 | 905969664000 |
Compute more
?
Technical details
- Node id
n-fc48bc04eb0177e8· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-f9762973ec1089d7
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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 8, 24; 2: 27, 162, 243; 3: 64, 576, 1728, 1728; 4: 125, 1500, 6750, 13500, 10125; 5: 216, 3240, 19440, 58320, 87480, 52488; 6: 343, 6174, 46305, 185220, 416745, 500094, 250047; 7: 512, 10752, 96768, 483840, 1451520, 2612736, 2612736, 1119744; 8: 729, 17496, 183708, 1102248, 4133430, 9920232, 14880348, 12754584, 4782969; 9: 1000, 27000, 324000, 2268000, 10206000, 30618000, 61236000, 78732000, 59049000, 19683000;
%F FormulaThe row polynomials satisfy (n^4-2*n^3+n^2)*P(n,x) = -(n^4+2*n^3+n^2+(6*n^4+12*n^3+6*n^2)*x+(9*n^4+18*n^3+9*n^2)*x^2)*P(n-2,x) + (2*n^4-4*n^2+2+(6*n^4-12*n^2+6)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 8 + 24*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 8 + 24*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^4 + 2*n^3 + n^2 + (6*n^4 + 12*n^3 + 6*n^2)*x + (9*n^4 + 18*n^3 + 9*n^2)*x^2)*P[n - 2, x] + (2*n^4 - 4*n^2 + 2 + (6*n^4 - 12*n^2 + 6)*x)*P[n - 1, x])/(n^4 - 2*n^3 + n^2)]];
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 + 24*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^4 + 2*n^3 + n^2 + (6*n^4 + 12*n^3 + 6*n^2)*x + (9*n^4 + 18*n^3 + 9*n^2)*x^2)*v[i - 2] + (2*n^4 - 4*n^2 + 2 + (6*n^4 - 12*n^2 + 6)*x)*v[i - 1])/(n^4 - 2*n^3 + n^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 Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
theta_plus_one of a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
theta_plus_one of a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) 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)
-
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 ›
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s 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)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s 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)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Laguerre’s 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)
- ↑ Pólya–Schur theorem on multiplier sequences (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)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
-
-
from
theta_plus_one of Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.?
Related ?
Same fingerprint ?
- basis-map coefficients of A026729, shifted → D → basis A013610
- basis-map coefficients of A112227 → θ+1 → basis A013610
- basis-map coefficients of A026729 → (θ+1)² → basis A013610
- A038330 → reverse
- A136572 → (θ+1)² → basis A013610
- A127648 → D → basis A013610
- A130123 → D → basis A013610
- basis-map coefficients of A030528, shifted → θ+1 → basis A013610
- basis-map coefficients of A030528, shifted → basis A013610 → reverse
- A120909 → x ↦ x/(x+1)
- A131436 → basis A013610
- basis-map coefficients of A026729 → basis A013610
- A094305 → x ↦ x+1 → x ↦ x+1
- basis-map coefficients of A021012 → basis A013610
- A027465 → D
- A085880 → basis A013611 → x ↦ x/(x+1)
- A013610 → basis A013611 → D
- basis-map coefficients of A112227 → basis A013610
- A147716 → basis A013610 → basis A013609
- A132440 → θ+1 → basis A013610
- A013610 → D
- A178820 → basis A013611 → x ↦ x/(x+1)
- A156992 → basis A007318 → x ↦ x+1
- A136572 → D → basis A013610
- basis-map coefficients of A026729, shifted → basis A013610 → basis A013611
- image under θ+1 → basis A013610
- A131431 → basis A013610
- A130123 → basis A013610 → basis A013611
- basis-map coefficients of A112227 → basis A013610 → reverse
- A136572 → θ+1 → basis A013610
- basis-map coefficients of A026729 → basis A013610 → D
- A136572 → basis A013610
- A130123 → basis A013610
- A136572 → basis A013610 → basis A013611
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*4^j.
- A127648 → basis A013610
- basis-map coefficients of A030528, shifted → D → basis A013610
- A134309 → basis A013610
- basis-map coefficients of A026729 → basis A013610 → basis A013611
- A120909 → basis A013610 → x ↦ x/(x+1)
- A013610 → D → D
- A130123 → θ+1 → basis A013610
- A028326 → basis A007318 → basis A007318
- A038330 → basis A013609 → x ↦ x+1
- A038279 → basis A013610 → D
- A038243 → basis A013609 → D
- basis-map coefficients of A026729, shifted → (θ+1)² → basis A013610
- A120910 → basis A007318
- A178822 → basis A013611 → x ↦ x/(x+1)
- A136521 → basis A013610
- basis-map coefficients of A030528, shifted → basis A013610 → D
- A178820 → basis A007318 → basis A007318
- A085881 → basis A013611 → x ↦ x/(x+1)
- A085880 → x ↦ x+1 → x ↦ x+1
- A131431 → θ+1 → basis A013610
- A013609 → basis A013610 → x ↦ x/(x+1)
- A120910 → basis A007318 → reverse
- A131431 → D → basis A013610
- A130123 → (θ+1)² → basis A013610
- A038279 → basis A013610
- A129186 → basis A013610
- basis-map coefficients of A030528, shifted → basis A013610
- A038338 → x ↦ x+1 → basis A007318
- A196347 → basis A013611 → x ↦ x/(x+1)
- image under θ+1 → θ+1 → D → basis A013610
- A038329 → x ↦ x+1 → basis A013609
- A156992 → basis A013611 → x ↦ x/(x+1)
- basis-map coefficients of A026729 → D → basis A013610
- A038221 → basis A013611 → x ↦ x/(x+1)
- A013610 → D → basis A013611
- basis-map coefficients of A026729, shifted → basis A013610
- basis-map coefficients of A026729, shifted → basis A013610 → D
- basis-map coefficients of A030528, shifted → basis A013610 → basis A013611
- basis-map coefficients of A112227 → basis A013610 → D
- A196347 → x ↦ x+1 → basis A007318
- A038243 → basis A013609
- A135065 → x ↦ x+1 → basis A007318
- A038330 → D
- basis-map coefficients of A026729, shifted → basis A013610 → reverse
- A013610: Triangle of coefficients in expansion of (1+3*x)^n.
- A013610 → basis A013611
- A178821 → basis A007318 → x ↦ x+1
- A027465: Cube of lower triangular normalized binomial matrix.
- basis-map coefficients of A112227 → basis A013610 → basis A013611
- A027465 → D → D
- A356546 → basis A013611 → x ↦ x/(x+1)
- A130123 → basis A013610 → D
- basis-map coefficients of A030528, shifted → (θ+1)² → basis A013610
- A038279 → basis A013610 → reverse
- A136572 → basis A013610 → D
- basis-map coefficients of A112227 → (θ+1)² → basis A013610
- A028326 → basis A013611 → x ↦ x/(x+1)
- A013610 → basis A013611 → reverse
- A085881 → basis A007318 → basis A007318
- A120910 → D → x ↦ x+1
- A356546 → x ↦ x+1 → x ↦ x+1
- A178822 → x ↦ x+1 → x ↦ x+1
- A038325 → basis A007318 → basis A007318
- basis-map coefficients of A026729 → basis A013610 → reverse
- basis-map coefficients of A021012 → θ+1 → basis A013610
- basis-map coefficients of A026729, shifted → θ+1 → basis A013610
- A178821 → basis A013611 → x ↦ x/(x+1)
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.