A094305 → x ↦ x+1 → D+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-x + x^{3} - n + 3\,n x^{2} + 3\,n^{2} x + n^{3}\right)\,P_{n}(x) = \left(16\,x + 48\,x^{2} + 56\,x^{3} + 32\,x^{4} + 9\,x^{5} + x^{6} + 16\,n + 72\,n x + 108\,n x^{2} + 74\,n x^{3} + 24\,n x^{4} + 3\,n x^{5} + 24\,n^{2} + 60\,n^{2} x + 54\,n^{2} x^{2} + 21\,n^{2} x^{3} + 3\,n^{2} x^{4} + 8\,n^{3} + 12\,n^{3} x + 6\,n^{3} x^{2} + n^{3} x^{3}\right)\,P_{n-3}(x) + \left(24 + 36\,x - 6\,x^{2} - 33\,x^{3} - 18\,x^{4} - 3\,x^{5} + 12\,n - 36\,n x - 81\,n x^{2} - 48\,n x^{3} - 9\,n x^{4} - 24\,n^{2} - 60\,n^{2} x - 42\,n^{2} x^{2} - 9\,n^{2} x^{3} - 12\,n^{3} - 12\,n^{3} x - 3\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-12\,x + 9\,x^{3} + 3\,x^{4} - 12\,n + 6\,n x + 24\,n x^{2} + 9\,n x^{3} + 6\,n^{2} + 21\,n^{2} x + 9\,n^{2} x^{2} + 6\,n^{3} + 3\,n^{3} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 9 + 3\,x\)
\(P_{2}(x) = 48 + 36\,x + 6\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 9 | 3 | 12 | |||||||||||||
| 2 | 48 | 36 | 6 | 90 | ||||||||||||
| 3 | 200 | 240 | 90 | 10 | 540 | |||||||||||
| 4 | 720 | 1200 | 720 | 180 | 15 | 2835 | ||||||||||
| 5 | 2352 | 5040 | 4200 | 1680 | 315 | 21 | 13608 | |||||||||
| 6 | 7168 | 18816 | 20160 | 11200 | 3360 | 504 | 28 | 61236 | ||||||||
| 7 | 20736 | 64512 | 84672 | 60480 | 25200 | 6048 | 756 | 36 | 262440 | |||||||
| 8 | 57600 | 207360 | 322560 | 282240 | 151200 | 50400 | 10080 | 1080 | 45 | 1082565 | ||||||
| 9 | 154880 | 633600 | 1140480 | 1182720 | 776160 | 332640 | 92400 | 15840 | 1485 | 55 | 4330260 | |||||
| 10 | 405504 | 1858560 | 3801600 | 4561920 | 3548160 | 1862784 | 665280 | 158400 | 23760 | 1980 | 66 | 16888014 | ||||
| 11 | 1038336 | 5271552 | 12080640 | 16473600 | 14826240 | 9225216 | 4036032 | 1235520 | 257400 | 34320 | 2574 | 78 | 64481508 | |||
| 12 | 2609152 | 14536704 | 36900864 | 56376320 | 57657600 | 41513472 | 21525504 | 8072064 | 2162160 | 400400 | 48048 | 3276 | 91 | 241805655 | ||
| 13 | 6451200 | 39137280 | 109025280 | 184504320 | 211411200 | 172972800 | 103783680 | 46126080 | 15135120 | 3603600 | 600600 | 65520 | 4095 | 105 | 892820880 | |
| 14 | 15728640 | 103219200 | 313098240 | 581468160 | 738017280 | 676515840 | 461260800 | 237219840 | 92252160 | 26906880 | 5765760 | 873600 | 87360 | 5040 | 120 | 3252418920 |
Compute more
?
Technical details
- Node id
n-c11a77a101be52d0· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-49d880ced4b36b3a
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: 9, 3; 2: 48, 36, 6; 3: 200, 240, 90, 10; 4: 720, 1200, 720, 180, 15; 5: 2352, 5040, 4200, 1680, 315, 21; 6: 7168, 18816, 20160, 11200, 3360, 504, 28; 7: 20736, 64512, 84672, 60480, 25200, 6048, 756, 36; 8: 57600, 207360, 322560, 282240, 151200, 50400, 10080, 1080, 45; 9: 154880, 633600, 1140480, 1182720, 776160, 332640, 92400, 15840, 1485, 55;
%F FormulaThe row polynomials satisfy (n^3-n+(3*n^2-1)*x+3*n*x^2+x^3)*P(n,x) = (8*n^3+24*n^2+16*n+(12*n^3+60*n^2+72*n+16)*x+(6*n^3+54*n^2+108*n+48)*x^2+(n^3+21*n^2+74*n+56)*x^3+(3*n^2+24*n+32)*x^4+(3*n+9)*x^5+x^6)*P(n-3,x) - (12*n^3+24*n^2-12*n-24+(12*n^3+60*n^2+36*n-36)*x+(3*n^3+42*n^2+81*n+6)*x^2+(9*n^2+48*n+33)*x^3+(9*n+18)*x^4+3*x^5)*P(n-2,x) + (6*n^3+6*n^2-12*n+(3*n^3+21*n^2+6*n-12)*x+(9*n^2+24*n)*x^2+(9*n+9)*x^3+3*x^4)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 9 + 3*x, P(2,x) = 48 + 36*x + 6*x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 9 + 3*x;
P[2, x_] := 48 + 36*x + 6*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((8*n^3 + 24*n^2 + 16*n + (12*n^3 + 60*n^2 + 72*n + 16)*x + (6*n^3 + 54*n^2 + 108*n + 48)*x^2 + (n^3 + 21*n^2 + 74*n + 56)*x^3 + (3*n^2 + 24*n + 32)*x^4 + (3*n + 9)*x^5 + x^6)*P[n - 3, x] - (12*n^3 + 24*n^2 - 12*n - 24 + (12*n^3 + 60*n^2 + 36*n - 36)*x + (3*n^3 + 42*n^2 + 81*n + 6)*x^2 + (9*n^2 + 48*n + 33)*x^3 + (9*n + 18)*x^4 + 3*x^5)*P[n - 2, x] + (6*n^3 + 6*n^2 - 12*n + (3*n^3 + 21*n^2 + 6*n - 12)*x + (9*n^2 + 24*n)*x^2 + (9*n + 9)*x^3 + 3*x^4)*P[n - 1, x])/(n^3 - n + (3*n^2 - 1)*x + 3*n*x^2 + x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 9 + 3*x; v[3] = 48 + 36*x + 6*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((8*n^3 + 24*n^2 + 16*n + (12*n^3 + 60*n^2 + 72*n + 16)*x + (6*n^3 + 54*n^2 + 108*n + 48)*x^2 + (n^3 + 21*n^2 + 74*n + 56)*x^3 + (3*n^2 + 24*n + 32)*x^4 + (3*n + 9)*x^5 + x^6)*v[i - 3] - (12*n^3 + 24*n^2 - 12*n - 24 + (12*n^3 + 60*n^2 + 36*n - 36)*x + (3*n^3 + 42*n^2 + 81*n + 6)*x^2 + (9*n^2 + 48*n + 33)*x^3 + (9*n + 18)*x^4 + 3*x^5)*v[i - 2] + (6*n^3 + 6*n^2 - 12*n + (3*n^3 + 21*n^2 + 6*n - 12)*x + (9*n^2 + 24*n)*x^2 + (9*n + 9)*x^3 + 3*x^4)*v[i - 1])/(n^3 - n + (3*n^2 - 1)*x + 3*n*x^2 + 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
shift_x_plus_one of Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? 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)
-
Geometric basis map (elementary) polytool ? step ›
-
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?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
- ↑ Laguerre’s 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.?
-
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?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ 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.?
-
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)
- ↑ 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.?
-
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
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
- ↑ Laguerre’s 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)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s 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)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s 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)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
from
Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
-
-
from
shift_x_plus_one of Triangle read by rows: T(n,k) = ((n+1)(n+2)/2) * binomial(n,k) (0 <= k <= n).?
Related ?
Same fingerprint ?
- A120910 → D → D+1
- A038338 → x ↦ x+1 → D+1
- A156992 → basis A007318 → D+1
- A038207 → D+1
- A196347 → x ↦ x+1 → D+1
- A085880 → x ↦ x+1 → D+1
- A356546 → x ↦ x+1 → D+1
- A103406 → x ↦ x/(x+1)
- basis-map coefficients of A113214, shifted → x ↦ x+1 → D+1
- A178820 → basis A007318 → D+1
- A038221 → x ↦ x+1 → D+1
- A093375 → D → basis A007318
- A120910 → D+1
- A028326 → basis A007318 → D+1
- A038325 → basis A007318 → D+1
- A003506 → x ↦ x+1 → D+1
- A135065 → x ↦ x+1 → D+1
- A178821 → basis A007318 → D+1
- A038330 → basis A013609 → D+1
- A093375 → x ↦ x+1
- A093375 → x ↦ x+1 → reverse
- A085881 → basis A007318 → D+1
- A178822 → x ↦ x+1 → D+1
- A027466 → basis A013611 → D+1
- A038208 → basis A007318 → D+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.