A127773 → (θ+1)² → x ↦ x+1
palindromicγ-positivenonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(\left(4\,n^{2} - 12\,n^{3} + 13\,n^{4} - 6\,n^{5} + n^{6}\right)\,P_{n}(x) = \left(n^{2} + 3\,n^{2} x + 3\,n^{2} x^{2} + n^{2} x^{3} - 2\,n^{4} - 6\,n^{4} x - 6\,n^{4} x^{2} - 2\,n^{4} x^{3} + n^{6} + 3\,n^{6} x + 3\,n^{6} x^{2} + n^{6} x^{3}\right)\,P_{n-3}(x) + \left(-12\,n^{2} - 24\,n^{2} x - 12\,n^{2} x^{2} - 12\,n^{3} - 24\,n^{3} x - 12\,n^{3} x^{2} + 9\,n^{4} + 18\,n^{4} x + 9\,n^{4} x^{2} + 6\,n^{5} + 12\,n^{5} x + 6\,n^{5} x^{2} - 3\,n^{6} - 6\,n^{6} x - 3\,n^{6} x^{2}\right)\,P_{n-2}(x) + \left(12 + 12\,x - 12\,n - 12\,n x - 21\,n^{2} - 21\,n^{2} x + 24\,n^{3} + 24\,n^{3} x + 6\,n^{4} + 6\,n^{4} x - 12\,n^{5} - 12\,n^{5} x + 3\,n^{6} + 3\,n^{6} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 12 + 12\,x\)
\(P_{2}(x) = 54 + 108\,x + 54\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 12 | 12 | 24 | ||||||
| 2 | 54 | 108 | 54 | 216 | |||||
| 3 | 160 | 480 | 480 | 160 | 1280 | ||||
| 4 | 375 | 1500 | 2250 | 1500 | 375 | 6000 | |||
| 5 | 756 | 3780 | 7560 | 7560 | 3780 | 756 | 24192 | ||
| 6 | 1372 | 8232 | 20580 | 27440 | 20580 | 8232 | 1372 | 87808 | |
| 7 | 2304 | 16128 | 48384 | 80640 | 80640 | 48384 | 16128 | 2304 | 294912 |
Compute more
?
Technical details
- Node id
n-52a557efbe1a7c54· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-77a7ed3b1d5f257e
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: yes
- γ-positive (gamma_positive): yes
- 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: 12, 12; 2: 54, 108, 54; 3: 160, 480, 480, 160; 4: 375, 1500, 2250, 1500, 375; 5: 756, 3780, 7560, 7560, 3780, 756; 6: 1372, 8232, 20580, 27440, 20580, 8232, 1372; 7: 2304, 16128, 48384, 80640, 80640, 48384, 16128, 2304; 8: 3645, 29160, 102060, 204120, 255150, 204120, 102060, 29160, 3645; 9: 5500, 49500, 198000, 462000, 693000, 693000, 462000, 198000, 49500, 5500;
%F FormulaThe row polynomials satisfy (n^6-6*n^5+13*n^4-12*n^3+4*n^2)*P(n,x) = (n^6-2*n^4+n^2+(3*n^6-6*n^4+3*n^2)*x+(3*n^6-6*n^4+3*n^2)*x^2+(n^6-2*n^4+n^2)*x^3)*P(n-3,x) - (3*n^6-6*n^5-9*n^4+12*n^3+12*n^2+(6*n^6-12*n^5-18*n^4+24*n^3+24*n^2)*x+(3*n^6-6*n^5-9*n^4+12*n^3+12*n^2)*x^2)*P(n-2,x) + (3*n^6-12*n^5+6*n^4+24*n^3-21*n^2-12*n+12+(3*n^6-12*n^5+6*n^4+24*n^3-21*n^2-12*n+12)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 12 + 12*x, P(2,x) = 54 + 108*x + 54*x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 12 + 12*x;
P[2, x_] := 54 + 108*x + 54*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n^6 - 2*n^4 + n^2 + (3*n^6 - 6*n^4 + 3*n^2)*x + (3*n^6 - 6*n^4 + 3*n^2)*x^2 + (n^6 - 2*n^4 + n^2)*x^3)*P[n - 3, x] - (3*n^6 - 6*n^5 - 9*n^4 + 12*n^3 + 12*n^2 + (6*n^6 - 12*n^5 - 18*n^4 + 24*n^3 + 24*n^2)*x + (3*n^6 - 6*n^5 - 9*n^4 + 12*n^3 + 12*n^2)*x^2)*P[n - 2, x] + (3*n^6 - 12*n^5 + 6*n^4 + 24*n^3 - 21*n^2 - 12*n + 12 + (3*n^6 - 12*n^5 + 6*n^4 + 24*n^3 - 21*n^2 - 12*n + 12)*x)*P[n - 1, x])/(n^6 - 6*n^5 + 13*n^4 - 12*n^3 + 4*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] = 12 + 12*x; v[3] = 54 + 108*x + 54*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n^6 - 2*n^4 + n^2 + (3*n^6 - 6*n^4 + 3*n^2)*x + (3*n^6 - 6*n^4 + 3*n^2)*x^2 + (n^6 - 2*n^4 + n^2)*x^3)*v[i - 3] - (3*n^6 - 6*n^5 - 9*n^4 + 12*n^3 + 12*n^2 + (6*n^6 - 12*n^5 - 18*n^4 + 24*n^3 + 24*n^2)*x + (3*n^6 - 6*n^5 - 9*n^4 + 12*n^3 + 12*n^2)*x^2)*v[i - 2] + (3*n^6 - 12*n^5 + 6*n^4 + 24*n^3 - 21*n^2 - 12*n + 12 + (3*n^6 - 12*n^5 + 6*n^4 + 24*n^3 - 21*n^2 - 12*n + 12)*x)*v[i - 1])/(n^6 - 6*n^5 + 13*n^4 - 12*n^3 + 4*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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
theta_plus_one_squared of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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 multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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
theta_plus_one of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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
theta_plus_one_squared 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 → basis A007318
- A085881 → basis A013609 → D
- A038330 → basis A013611 → D
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*12^j.
- A178821 → basis A013609 → basis A013609
- A178821 → basis A013609
- A178820 → basis A007318 → basis A013610
- A237765: Triangular array read by rows: T(n,k) = binomial(n,2)*binomial(n,k), n>=0, 0<=k<=n.
- A038221 → basis A013609 → D
- A085880 → x ↦ x+1 → basis A013610
- A038330 → basis A013611 → basis A013609
- A178821 → basis A013609 → D
- basis-map coefficients of A030528, shifted → θ+1 → basis A007318
- basis-map coefficients of A113214, shifted → D
- A038338 → basis A013609
- basis-map coefficients of A026729 → basis A007318 → basis A013609
- A038221: Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.
- veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).
- veronese parent of Binomial coefficients C(n,k) with n-k odd, read by rows.
- A156992 → basis A013609 → basis A013609
- A120910 → basis A013610 → basis A013609
- A258758: Triangle T(n,k) = C(n+k-1,k)*C(2*n-1,n-k).
- A038325 → basis A013609
- A196347 → x ↦ x+1 → basis A013610
- A007318: Binomial
- A178822 → basis A013609 → basis A013609
- A380114: Triangle read by rows: The convolution triangle of 2^n, where the convolution triangle of a sequence is define…
- A134346 → basis A013609
- basis-map coefficients of A113214, shifted → D → basis A013609
- A156992 → D
- A196347 → basis A013609 → D
- A124860: A Jacobsthal-Pascal triangle.
- A007318 → ×(−(1/2)n+(1/2)n²) → D
- A178821: Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.
- A120910 → basis A007318 → basis A013611
- A178822: Triangle read by rows: T(n,k) = C(n+5,5) * C(n,k), 0 <= k <= n.
- A038208 → D → D
- A085881 → basis A013609 → basis A013609
- A038221 → basis A013609
- A127952: Triangle read by rows, T(n,k) = (n+1)*binomial(n-1,k-1).
- A135065 → basis A013609
- A085881 → basis A007318 → basis A013610
- veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).
- A131431 → (θ+1)² → x ↦ x+1
- A094305 → D
- A124860 → D
- A178821 → D
- basis-map coefficients of A026729 → D → basis A007318
- veronese parent of Binomial coefficients C(n,k) with n-k even, read by rows.
- A085881 → basis A013609
- A038338 → D
- A132200: Numbers in (4,4)-Pascal triangle .
- A027465 → basis A013611
- A003506 → basis A013609
- A094305 → basis A013609
- A135089: Triangle T(n,k) = 5*binomial(n,k) with T(0,0) = 1, read by rows.
- basis-map coefficients of A026729 → (θ+1)² → basis A007318
- A134346 → D
- basis-map coefficients of A113214, shifted → basis A013609 → D
- A178822 → basis A013609 → D
- A356546 → basis A013609 → D
- A038208: Triangle whose (i,j)-th entry is binomial(i,j)*2^i.
- A131431 → x ↦ x+1 → basis A013609
- A003506 → D
- A134058: Triangle T(n, k) = 2*binomial(n, k) with T(0, 0) = 1, read by rows.
- A038330 → basis A013611
- basis-map coefficients of A026729, shifted → (θ+1)² → basis A007318
- A356546 → basis A013609
- basis-map coefficients of Riordan array (1+2x,x(1+x)). shifted by x -> -x + 0
- A156992 → basis A013609
- A038208 → D
- A178822 → basis A013609
- basis-map coefficients of Triangle read by rows: row n consists of n-1 zeros followed by Fibonacci(n).
- A085880 → D
- A134059 → basis A013609
- A178822 → x ↦ x+1 → basis A013610
- A134309 → basis A007318
- A027465 → basis A013611 → D
- basis-map coefficients of A030528, shifted → (θ+1)² → x ↦ x+1
- A178820: Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.
- A038338 → basis A013609 → D
- A127773 → θ+1 → x ↦ x+1
- basis-map coefficients of A021012 → x ↦ x+1
- A156992: Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.
- A094305: Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).
- A134059: Triangle T(n, k) = 3*binomial(n,k) with T(0, 0) = 1, read by rows.
- A135838 → basis A013609
- A258758 → basis A013609
- A356546 → x ↦ x+1 → basis A013610
- A003506: Triangle of denominators in Leibniz's Harmonic Triangle a(n,k), n >= 1, 1 <= k <= n.
- A344565: Triangle read by rows, for 0 <= k <= n: T(n, k) = binomial(n, k) * binomial(binomial(n + 3, 2), 2).
- Hadamard-factor parent of A127773 → x ↦ x+1
- A028326 → basis A013609
- A038221 → D
- A156992 → basis A013609 → D
- A376827 → basis A013609
- A038221 → x ↦ x+1 → basis A013610
- A028326 → basis A013609 → D
- basis-map coefficients of A113214, shifted → x ↦ x+1 → basis A013610
- A120910 → basis A013610
- basis-map coefficients of A026729, shifted → basis A007318 → basis A013609
- A356546 → D
- A216973: Exponential Riordan array [x*exp(x),x].
- A178821 → basis A007318 → basis A013610
- A376827 → D
- A127648 → (θ+1)² → x ↦ x+1
- A085881: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by A001147(n).
- A356546: Triangle read by rows. T(n, k) = RisingFactorial(n + 1, n) / (k! * (n - k)!).
- A028326 → basis A007318 → basis A013610
- A178820 → basis A013609 → basis A013609
- A085881 → D
- A027465 → D → basis A013611
- A344565 → basis A013609
- A129186 → basis A007318
- A085880 → basis A013609
- A178820 → basis A013609
- A085880 → D → basis A013609
- A134058 → basis A013609
- Riordan array (1-x,x/(1-x)).
- basis-map coefficients of A112227 → x ↦ x+1
- basis-map coefficients of A112227 → θ+1 → x ↦ x+1
- A131431 → x ↦ x+1
- A085880: Triangle T(n,k) read by rows: multiply row n of Pascal's triangle (A007318) by the n-th Catalan number (A00010…
- A038338 → basis A013609 → basis A013609
- A258758 → D
- A135089 → basis A013609
- A027465 → basis A013611 → basis A013609
- A028326 → D → D
- A196347 → D
- A134346: Triangle read by rows: T(n,k) = (2^(n+1)-1)*binomial(n,k).
- A028326: Twice Pascal's triangle A007318: T(n,k) = 2*C(n,k).
- basis-map coefficients of A026729 → basis A007318
- A131431 → θ+1 → basis A007318
- A356546 → basis A013609 → basis A013609
- A129533: Array read by antidiagonals: T(n,k) = binomial(n+1,2)*binomial(n+k,n+1) for 0 <= k <= n.
- A038325 → basis A007318 → basis A013610
- A038338 → x ↦ x+1 → basis A013610
- veronese parent of Triangle T(n,k) with diagonals T(n,n-k) = binomial(n,3k).
- A085880 → D → D
- A038325 → basis A013609 → D
- A028326 → basis A013609 → basis A013609
- A094305 → x ↦ x+1 → basis A013610
- A135065 → x ↦ x+1 → basis A013610
- basis-map coefficients of A127647 → basis A013609
- A124860 → basis A013609
- A376827: T(n, k) = binomial(n, k)*hypergeom([(1 - n)/2, -n/2], [1], 4).
- A038325 → basis A013609 → basis A013609
- A219570: Triangular array read by rows. T(n,k) is the number of necklaces (turning over is not allowed) of n labeled b…
- A135838: Triangle read by rows: T(n,k) = 2^floor(n/2)*binomial(n-1,k-1).
- A038325 → D
- A097805: Number of compositions of n with k parts, T(n, k) = binomial(n-1, k-1) for n, k >= 1 and T(n, 0) = 0^n, triang…
- A344565 → D
- A196347: Triangle T(n, k) read by rows, T(n, k) = n!*binomial(n, k).
- A134059 → D
- A003506 → D → D
- A028326 → D
- A178820 → D
- A085880 → basis A013609 → D
- basis-map coefficients of A113214, shifted → D → D
- A130123 → θ+1 → basis A007318
- A135065: A127733 * A007318 as infinite lower triangular matrices.
- image under θ+1 → (θ+1)² → x ↦ x+1
- Second weight array of Pascal's triangle (formatted as a rectangle), by antidiagonals.
- A038279 → basis A013610 → basis A013611
- A120910 → basis A013610 → D
- A135838 → D
- A135065 → D
- A003506 → x ↦ x+1 → basis A013610
- A196347 → basis A013609
- basis-map coefficients of A026729, shifted → D → basis A007318
- A132440 → θ+1 → x ↦ x+1
- A038325: Triangle read by rows whose (i,j)-th entry is binomial(i,j)*11^(i-j)*11^j.
- A196347 → basis A013609 → basis A013609
- basis-map coefficients of A026729, shifted → θ+1 → x ↦ x+1
- basis-map coefficients of A113214, shifted → basis A013609 → basis A013609
- basis-map coefficients of A127647 → D
- image under θ+1 → x ↦ x+1
- A136572 → (θ+1)² → basis A007318
- basis-map coefficients of A112227 → x ↦ x+1 → basis A013609
- basis-map coefficients of A112227 → (θ+1)² → basis A007318
- A085880 → basis A013609 → basis A013609
- basis-map coefficients of A021012 → θ+1 → basis A007318
- A178820 → basis A013609 → D
- A178822 → D
- basis-map coefficients of A113214, shifted → basis A013609
- A132200 → basis A013609
- A156992 → basis A007318 → basis A013610
- A038208 → D → basis A013609
- A003506 → D → basis A013609
- A132200 → D
- A135089 → D
- A131431 → x ↦ x+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.