A094305 → basis A013611
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(8 + 48\,x + 96\,x^{2} + 64\,x^{3}\right)\,P_{n-3}(x) + \left(-12 - 48\,x - 48\,x^{2}\right)\,P_{n-2}(x) + \left(6 + 12\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 6 + 12\,x\)
\(P_{2}(x) = 24 + 96\,x + 96\,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 | 6 | 12 | 18 | |||||||||||||
| 2 | 24 | 96 | 96 | 216 | ||||||||||||
| 3 | 80 | 480 | 960 | 640 | 2160 | |||||||||||
| 4 | 240 | 1920 | 5760 | 7680 | 3840 | 19440 | ||||||||||
| 5 | 672 | 6720 | 26880 | 53760 | 53760 | 21504 | 163296 | |||||||||
| 6 | 1792 | 21504 | 107520 | 286720 | 430080 | 344064 | 114688 | 1306368 | ||||||||
| 7 | 4608 | 64512 | 387072 | 1290240 | 2580480 | 3096576 | 2064384 | 589824 | 10077696 | |||||||
| 8 | 11520 | 184320 | 1290240 | 5160960 | 12902400 | 20643840 | 20643840 | 11796480 | 2949120 | 75582720 | ||||||
| 9 | 28160 | 506880 | 4055040 | 18923520 | 56770560 | 113541120 | 151388160 | 129761280 | 64880640 | 14417920 | 554273280 | |||||
| 10 | 67584 | 1351680 | 12165120 | 64880640 | 227082240 | 544997376 | 908328960 | 1038090240 | 778567680 | 346030080 | 69206016 | 3990767616 | ||||
| 11 | 159744 | 3514368 | 35143680 | 210862080 | 843448320 | 2361655296 | 4723310592 | 6747586560 | 6747586560 | 4498391040 | 1799356416 | 327155712 | 28298170368 | |||
| 12 | 372736 | 8945664 | 98402304 | 656015360 | 2952069120 | 9446621184 | 22042116096 | 37786484736 | 47233105920 | 41984983040 | 25190989824 | 9160359936 | 1526726656 | 198087192576 | ||
| 13 | 860160 | 22364160 | 268369920 | 1968046080 | 9840230400 | 35424829440 | 94466211840 | 188932423680 | 283398635520 | 314887372800 | 251909898240 | 137405399040 | 45801799680 | 7046430720 | 1371372871680 | |
| 14 | 1966080 | 55050240 | 715653120 | 5725224960 | 31488737280 | 125954949120 | 377864847360 | 863691079680 | 1511459389440 | 2015279185920 | 2015279185920 | 1465657589760 | 732828794880 | 225485783040 | 32212254720 | 9403699691520 |
Compute more
?
Technical details
- Node id
n-2352aed893dd9749· revision 0 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-11aec07ce60b6d61
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: 6, 12; 2: 24, 96, 96; 3: 80, 480, 960, 640; 4: 240, 1920, 5760, 7680, 3840; 5: 672, 6720, 26880, 53760, 53760, 21504; 6: 1792, 21504, 107520, 286720, 430080, 344064, 114688; 7: 4608, 64512, 387072, 1290240, 2580480, 3096576, 2064384, 589824; 8: 11520, 184320, 1290240, 5160960, 12902400, 20643840, 20643840, 11796480, 2949120; 9: 28160, 506880, 4055040, 18923520, 56770560, 113541120, 151388160, 129761280, 64880640, 14417920;
%F FormulaThe row polynomials satisfy P(n,x) = (8+48*x+96*x^2+64*x^3)*P(n-3,x) - (12+48*x+48*x^2)*P(n-2,x) + (6+12*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 6 + 12*x, P(2,x) = 24 + 96*x + 96*x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 6 + 12*x;
P[2, x_] := 24 + 96*x + 96*x^2;
P[n_, x_] := P[n, x] = Expand[(8 + 48*x + 96*x^2 + 64*x^3)*P[n - 3, x] - (12 + 48*x + 48*x^2)*P[n - 2, x] + (6 + 12*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 6 + 12*x; v[3] = 24 + 96*x + 96*x^2; for(n = 3, N, my(i = n + 1); v[i] = (8 + 48*x + 96*x^2 + 64*x^3)*v[i - 3] - (12 + 48*x + 48*x^2)*v[i - 2] + (6 + 12*x)*v[i - 1]); 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
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).?
Related ?
Same fingerprint ?
- image under θ+1 → basis A013609
- A135838 → x ↦ x/(x+1)
- A134058 → basis A013611
- A120910 → D
- A038221 → x ↦ x+1
- A038338 → x ↦ x+1
- A178821 → basis A007318
- A134346 → x ↦ x/(x+1)
- A003506 → x ↦ x/(x+1)
- A178822 → basis A013609 → x ↦ x+1
- A196347 → basis A013611
- A356546 → x ↦ x+1
- A124860 → x ↦ x/(x+1)
- A178821 → basis A013611 → D
- A038208 → basis A007318 → D
- A178820 → basis A007318 → D
- A027465 → D → basis A013609
- A038325 → basis A007318 → D
- basis-map coefficients of A026729, shifted → basis A013609 → D
- A134058 → basis A007318
- A178822 → basis A013611 → D
- A127648 → D → basis A013609
- A085881 → basis A013611 → reverse
- A003506 → D → basis A013611
- basis-map coefficients of A127647 → x ↦ x/(x+1)
- basis-map coefficients of A030528, shifted → basis A013609 → basis A013610
- basis-map coefficients of A030528, shifted → (θ+1)² → basis A013609
- A013609 → basis A013610
- A038330 → basis A013609
- A120909 → basis A013610
- A178821 → basis A013611
- A159854 → x ↦ x/(x+1)
- A134309 → basis A013609
- A356546 → basis A013611 → reverse
- A120909: Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maxi…
- A147716 → basis A013610 → basis A013610
- A134346 → x ↦ x+1
- A135065 → x ↦ x+1 → D
- A038325 → basis A013611
- A013609 → basis A013610 → basis A013610
- A028326 → basis A013611
- A038338 → basis A013609 → basis A007318
- A085880 → x ↦ x/(x+1)
- A038208 → x ↦ x/(x+1)
- A085881 → basis A007318
- A135838 → basis A013611
- A131431 → D → basis A013609
- basis-map coefficients of A112227 → x ↦ x+1 → basis A013611
- A178821 → x ↦ x/(x+1)
- basis-map coefficients of A112227 → basis A013609
- A131436 → basis A013609
- A132440 → θ+1 → basis A013609
- basis-map coefficients of A021012 → basis A013609
- A028326 → basis A013611 → basis A013610
- A356546 → basis A013611 → D
- A028326 → basis A007318
- basis-map coefficients of A030528, shifted → basis A013609 → D
- Veronese parent of A098172 → x ↦ x/(x+1)
- A038338 → x ↦ x+1 → reverse
- basis-map coefficients of A026729, shifted → basis A013609 → basis A013610
- A135065 → x ↦ x+1
- A178822 → x ↦ x/(x+1)
- A007318 → ×(−(1/2)n+(1/2)n²) → x ↦ x/(x+1)
- basis-map coefficients of A026729 → basis A013609 → basis A013610
- A038221 → basis A013611 → basis A013610
- A038338 → x ↦ x+1 → D
- A028326 → x ↦ x/(x+1)
- A120909 → basis A013610 → reverse
- basis-map coefficients of A026729 → D → basis A013609
- basis-map coefficients of A026729, shifted → basis A007318 → x ↦ x+1
- basis-map coefficients of A113214, shifted → basis A013611
- A131431 → basis A013609
- A038207: Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
- A038338 → basis A013611
- A136572 → θ+1 → basis A013609
- A344565 → basis A013611
- A003506 → x ↦ x+1
- A136572 → D → basis A013609
- A131431 → x ↦ x+1 → x ↦ x/(x+1)
- A178820 → basis A013609 → basis A013611
- A196347 → basis A013611 → D
- A131431 → x ↦ x+1 → basis A007318
- A085880 → basis A013611 → basis A013610
- A356546 → x ↦ x/(x+1)
- basis-map coefficients of A030528, shifted → basis A013609
- A085880 → x ↦ x+1
- A085880 → basis A013609 → x ↦ x+1
- basis-map coefficients of A026729 → basis A013609 → D
- A094305 → x ↦ x/(x+1)
- A130123 → θ+1 → basis A013609
- A131431 → x ↦ x+1 → basis A013611
- A132200 → basis A007318
- A028326 → basis A007318 → reverse
- basis-map coefficients of A030528, shifted → θ+1 → basis A013609
- A135065 → basis A013611
- A178822 → basis A013611
- basis-map coefficients of A026729 → basis A013609 → reverse
- image under θ+1 → (θ+1)² → basis A013609
- A094305 → x ↦ x+1 → D
- A356546 → basis A013611 → basis A013610
- basis-map coefficients of A026729 → basis A013609
- basis-map coefficients of A113214, shifted → basis A013609 → x ↦ x+1
- A038208 → basis A007318
- A134059 → basis A013611
- A156992 → basis A013609 → basis A007318
- A136572 → basis A013609
- Veronese parent of A098172 → x ↦ x/(x+1)
- A013609 → D
- A038208 → basis A013611 → D
- basis-map coefficients of A112227 → basis A013609 → basis A013610
- basis-map coefficients of A026729, shifted → basis A007318 → basis A013611
- A196347 → x ↦ x+1 → D
- A038221 → basis A013609 → basis A013611
- A120910 → basis A013610 → basis A013611
- A038329 → x ↦ x+1 → basis A013610
- A038221 → basis A013611 → D
- A038325 → basis A007318 → reverse
- A376827 → x ↦ x/(x+1)
- A156992 → basis A013611 → D
- A178822 → basis A013609 → basis A013611
- A156992 → basis A013611 → basis A013610
- basis-map coefficients of A026729, shifted → (θ+1)² → basis A013609
- A130123 → basis A013609
- A120909 → basis A013610 → basis A013610
- A085880 → D → basis A007318
- A178821 → basis A007318 → D
- A013609 → basis A013610 → D
- basis-map coefficients of A112227 → basis A013609 → D
- basis-map coefficients of A113214, shifted → D → basis A013611
- basis-map coefficients of A026729 → (θ+1)² → basis A013609
- A156992 → basis A013611
- A178820 → basis A013611
- A038330 → basis A013609 → reverse
- A156992 → basis A007318 → D
- A135089 → basis A007318
- A134346 → basis A013611
- A038208 → basis A013611
- basis-map coefficients of A113214, shifted → x ↦ x/(x+1)
- A085880 → x ↦ x+1 → reverse
- A134059 → basis A007318
- A124860 → basis A013611
- A178822 → x ↦ x+1 → reverse
- A356546 → basis A013611
- A085880 → D → basis A013611
- A038208 → D → basis A013611
- basis-map coefficients of A112227 → x ↦ x+1 → basis A007318
- A178822 → x ↦ x+1
- basis-map coefficients of A026729 → basis A007318 → basis A013611
- A129186 → basis A013609
- Veronese parent of A098172 → x ↦ x/(x+1)
- A156992 → basis A007318
- A196347 → basis A013609 → basis A007318
- A135065 → x ↦ x/(x+1)
- A178821 → basis A013609 → basis A013611
- A027465 → basis A013611 → basis A013611
- basis-map coefficients of A127647 → basis A007318
- A120909 → D
- A178820 → basis A013611 → reverse
- A135065 → x ↦ x+1 → reverse
- A028326 → basis A007318 → D
- A027466 → basis A013611
- image under θ+1 → θ+1 → D → basis A013609
- A136572 → basis A013609 → basis A013610
- basis-map coefficients of A112227 → (θ+1)² → basis A013609
- A178822 → basis A013611 → basis A013610
- A196347 → x ↦ x+1
- basis-map coefficients of A026729, shifted → θ+1 → basis A013609
- A038330 → basis A013611 → basis A007318
- A196347 → basis A013611 → basis A013610
- A094305 → x ↦ x+1
- basis-map coefficients of A113214, shifted → basis A013609 → basis A013611
- basis-map coefficients of A026729, shifted → D → basis A013609
- A356546 → x ↦ x+1 → reverse
- basis-map coefficients of A113214, shifted → D → basis A007318
- basis-map coefficients of A030528, shifted → D → basis A013609
- A085880 → basis A013609 → basis A013611
- A178822 → x ↦ x+1 → D
- A130123 → basis A013609 → D
- basis-map coefficients of A127647 → basis A013611
- A178821 → basis A013611 → basis A013610
- A258758 → basis A013611
- A013609: Triangle of coefficients in expansion of (1+2*x)^n.
- basis-map coefficients of A026729, shifted → basis A013609
- A085881 → basis A013611
- A178820 → basis A013611 → D
- A094305 → x ↦ x+1 → reverse
- A038325 → basis A007318
- A344565 → x ↦ x/(x+1)
- A132200 → basis A013611
- A156992 → x ↦ x/(x+1)
- A178820 → basis A013611 → basis A013610
- A376827 → basis A007318
- A132440 → basis A013609
- A124860 → x ↦ x+1
- A038330 → basis A013611 → x ↦ x/(x+1)
- A085880 → basis A013611
- A136572 → basis A013609 → D
- basis-map coefficients of A021012 → θ+1 → basis A013609
- A356546 → basis A013609 → basis A013611
- A085881 → basis A007318 → reverse
- A178820 → x ↦ x/(x+1)
- A038291 → basis A013609 → basis A013610
- A085880 → basis A013611 → D
- A038338 → x ↦ x/(x+1)
- A120910 → basis A007318 → basis A013609
- A085881 → basis A007318 → D
- A136521 → basis A013609
- A120910: Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-…
- A038330 → basis A013609 → D
- A135089 → basis A013611
- A038325 → x ↦ x/(x+1)
- A178821 → basis A007318 → reverse
- A178821 → basis A013611 → reverse
- A344565 → basis A007318
- A038221 → basis A013611
- A003506 → D → x ↦ x+1
- A028326 → basis A013609 → x ↦ x+1
- A136572 → (θ+1)² → basis A013609
- A258758 → basis A007318
- A376827 → basis A013611
- A120909 → basis A013610 → D
- A013609 → D → basis A013610
- A131431 → θ+1 → basis A013609
- A013609 → D → D
- A085881 → basis A013611 → basis A013610
- basis-map coefficients of A112227 → θ+1 → basis A013609
- A356546 → x ↦ x+1 → D
- A027466 → basis A013611 → D
- basis-map coefficients of A113214, shifted → x ↦ x+1
- A038325 → basis A013609 → basis A007318
- A135838 → x ↦ x+1
- A028326 → basis A013609 → basis A013611
- A085881 → x ↦ x/(x+1)
- A028326 → basis A013611 → D
- A085881 → basis A013611 → D
- A178820 → basis A007318 → reverse
- A007318 → ×(−(1/2)n+(1/2)n²) → x ↦ x+1
- A216973 → basis A013611
- A120910 → D → D
- A038221 → x ↦ x+1 → D
- A130123 → D → basis A013609
- A178820 → basis A007318
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.