A127773 → θ+1 → reverse
palindromicγ-positivenonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2\,n - 3\,n^{2} + n^{3}\right)\,P_{n}(x) = \left(-n + n^{3}\right)\,P_{n-3}(x) + \left(6\,n + 3\,n^{2} - 3\,n^{3}\right)\,P_{n-2}(x) + \left(6 - 3\,n - 6\,n^{2} + 3\,n^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 6\)
\(P_{2}(x) = 18\)
Rows ?
| n | x0 | Pn(1) |
|---|---|---|
| 0 | 1 | 1 |
| 1 | 6 | 6 |
| 2 | 18 | 18 |
| 3 | 40 | 40 |
| 4 | 75 | 75 |
| 5 | 126 | 126 |
| 6 | 196 | 196 |
| 7 | 288 | 288 |
| 8 | 405 | 405 |
| 9 | 550 | 550 |
| 10 | 726 | 726 |
| 11 | 936 | 936 |
| 12 | 1183 | 1183 |
| 13 | 1470 | 1470 |
| 14 | 1800 | 1800 |
Compute more
?
Technical details
- Node id
n-2d487bb06a750ce0· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-edf6954a4cd8adfc
Observed on the stored rows ?
- Degrees: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (affine: slope 0, 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: 6; 2: 18; 3: 40; 4: 75; 5: 126; 6: 196; 7: 288; 8: 405; 9: 550;
%F FormulaThe row polynomials satisfy (n^3-3*n^2+2*n)*P(n,x) = (n^3-n)*P(n-3,x) - (3*n^3-3*n^2-6*n)*P(n-2,x) + (3*n^3-6*n^2-3*n+6)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 6, P(2,x) = 18.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 6;
P[2, x_] := 18;
P[n_, x_] := P[n, x] = Expand[Together[((n^3 - n)*P[n - 3, x] - (3*n^3 - 3*n^2 - 6*n)*P[n - 2, x] + (3*n^3 - 6*n^2 - 3*n + 6)*P[n - 1, x])/(n^3 - 3*n^2 + 2*n)]];
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; v[3] = 18; for(n = 3, N, my(i = n + 1); v[i] = ((n^3 - n)*v[i - 3] - (3*n^3 - 3*n^2 - 6*n)*v[i - 2] + (3*n^3 - 6*n^2 - 3*n + 6)*v[i - 1])/(n^3 - 3*n^2 + 2*n)); 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
- 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 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.?
Related ?
Same fingerprint ?
- basis-map coefficients of A112227 → (θ+1)² → (θ+1)²
- image under θ+1 → θ+1 → D → θ+1
- A132440 → θ+1 → (θ+1)²
- A132440 → θ+1
- image under θ+1 → (θ+1)² → D
- basis-map coefficients of A030528, shifted → (θ+1)² → θ+1
- image under θ+1 → θ+1 → (θ+1)²
- A073423: Sums of two powers of zero: triangle read by rows: T(m,n) = 0^n + 0^m, n >= 0, m = 0..n.
- Hadamard-factor parent of A127773 → D
- A136572 → θ+1 → D
- image under θ+1 → (θ+1)²
- basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
- A196347 → γ
- basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
- A130123 → D → θ+1
- image under θ+1 → D
- A136572 → D → D
- A132440 → θ+1 → D
- A131431 → (θ+1)² → D
- basis-map coefficients of A026729, shifted → D → D
- A131431 → (θ+1)² → θ+1
- basis-map coefficients of A030528, shifted → D → D
- A130123 → (θ+1)² → reverse
- basis-map coefficients of A026729 → (θ+1)²
- A127648 → D → θ+1
- A127648 → D → D
- A131431 → (θ+1)² → reverse
- A130123: Infinite lower triangular matrix with 2^k in the right diagonal and the rest zeros. Triangle, T(n,k), n zeros …
- A073424: Triangle read by rows: T(m,n) = parity of 0^n + 0^m, n = 0,1,2,3 ..., m = 0,1,2,3, ... n.
- A132440: Infinitesimal Pascal matrix: generator (lower triangular matrix representation) of the Pascal matrix, the clas…
- A178820 → γ
- A131431 → D → D
- A127773 → θ+1
- A129184: Shift operator, right.
- A127648 → (θ+1)² → θ+1
- A131431: 3n + 1 preceded by n zeros.
- A127648 → (θ+1)² → (θ+1)²
- basis-map coefficients of A026729 → D → (θ+1)²
- A131436 → θ+1
- A131436 → reverse
- Hadamard-factor parent of A127773 → reverse
- A127773 → θ+1 → D
- basis-map coefficients of A297191, shifted → (θ+1)²
- A132774 → Veronese 2 (j=1) → θ+1
- A132774 → Veronese 2 → (θ+1)²
- A134309: Triangle read by rows, where row n consists of n zeros followed by 2^(n-1).
- basis-map coefficients of A030528, shifted → (θ+1)² → (θ+1)²
- basis-map coefficients of A030528, shifted → (θ+1)²
- basis-map coefficients of A297191, shifted → D → D
- basis-map coefficients of A030528, shifted → (θ+1)² → reverse
- basis-map coefficients of A026729, shifted → (θ+1)²
- A132774 → Veronese 2
- image under θ+1 → θ+1 → D → D
- A131436 → D
- A127648: Triangle read by rows: row n consists of n zeros followed by n+1.
- basis-map coefficients of A021012 → θ+1 → D
- A129186: Right shift operator generating 1's in shifted spaces.
- A178821 → γ
- A127648 → (θ+1)²
- basis-map coefficients of A297191, shifted → (θ+1)² → D
- A198954: Expansion of the rotational partition function for a heteronuclear diatomic molecule.
- basis-map coefficients of A026729, shifted → θ+1
- basis-map coefficients of A297191, shifted → D
- A136572 → (θ+1)² → reverse
- A130123 → θ+1
- veronese parent of Table read by rows: 1 if x = y, 0 otherwise, where (x,y) = (0,0),(0,1),(1,0),(0,2),(1,1),(2,0),...
- A132774 → Veronese 2 → θ+1
- Hadamard-factor parent of A127773 → θ+1
- A136572 → (θ+1)² → (θ+1)²
- A130123 → D → (θ+1)²
- basis-map coefficients of A026729, shifted → D → (θ+1)²
- basis-map coefficients of A030528, shifted → θ+1 → reverse
- A131431 → (θ+1)² → (θ+1)²
- basis-map coefficients of A026729 → (θ+1)² → reverse
- basis-map coefficients of A030528, shifted → D → θ+1
- A127773 → D
- basis-map coefficients of A030528, shifted → (θ+1)² → D
- basis-map coefficients of A026729 → D → D
- basis-map coefficients of A297191, shifted → θ+1
- A136521 → D
- A131431 → θ+1
- A130123 → (θ+1)² → θ+1
- basis-map coefficients of A297191, shifted → D → (θ+1)²
- basis-map coefficients of A112227 → (θ+1)² → reverse
- A136572 → D
- A127773: Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.
- A132774 → Veronese 2 → D
- A130123 → θ+1 → reverse
- A127648 → (θ+1)² → D
- basis-map coefficients of A112227 → (θ+1)² → θ+1
- basis-map coefficients of A026729 → (θ+1)² → θ+1
- A130123 → reverse
- basis-map coefficients of A021012 → D
- A136572 → (θ+1)² → θ+1
- A130123 → θ+1 → D
- A136572 → D → θ+1
- A130123 → (θ+1)² → (θ+1)²
- basis-map coefficients of A297191, shifted → θ+1 → D
- A085881 → γ
- A130123 → D
- A136572 → D → (θ+1)²
- basis-map coefficients of A112227 → D
- A132774 → Veronese 2 (j=1)
- basis-map coefficients of A026729 → (θ+1)² → (θ+1)²
- A356546 → γ
- basis-map coefficients of A026729 → D
- basis-map coefficients of A026729, shifted → reverse
- A127773 → (θ+1)² → reverse
- image under θ+1 → θ+1 → reverse
- A136572 → (θ+1)²
- basis-map coefficients of Triangular array read by rows: T(n,k) = binomial(n,2)*binomial(n,k), n>=0, 0<=k<=n.
- basis-map coefficients of A026729, shifted → (θ+1)² → θ+1
- A003506 → γ
- A038325 → γ
- A127648 → D → (θ+1)²
- A135838 → γ
- basis-map coefficients of A030528, shifted → θ+1 → D
- A136572 → θ+1
- basis-map coefficients of A021012 → θ+1
- basis-map coefficients of Triangle of coefficients in expansion of x^n in terms of Laguerre polynomials L_n(x).
- A028326 → γ
- basis-map coefficients of A026729, shifted → (θ+1)² → reverse
- basis-map coefficients of A112227 → θ+1 → reverse
- A156992 → γ
- basis-map coefficients of A297191, shifted → (θ+1)² → reverse
- image under θ+1 → θ+1 → D
- basis-map coefficients of A112227 → θ+1
- A136572 → (θ+1)² → D
- A136572: Triangle read by rows: row n consists of n zeros followed by n!.
- basis-map coefficients of A026729, shifted → θ+1 → D
- basis-map coefficients of A021012 → reverse
- theta_plus_one of a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
- A130123 → (θ+1)² → D
- Hadamard-factor parent of A127773 → (θ+1)²
- basis-map coefficients of A297191, shifted → (θ+1)² → (θ+1)²
- A178822 → γ
- basis-map coefficients of A026729 → (θ+1)² → D
- A136521: Triangle read by rows: (1, 2, 2, 2, ...) on the main diagonal and the rest zeros.
- A038221 → γ
- A130123 → (θ+1)²
- basis-map coefficients of A026729 → D → θ+1
- A132774 → Veronese 2 (j=1) → (θ+1)²
- basis-map coefficients of A021012 → θ+1 → reverse
- image under θ+1 → reverse
- A133080 → Veronese 2
- A134309 → D
- basis-map coefficients of A112227 → (θ+1)²
- basis-map coefficients of A026729, shifted → D → θ+1
- basis-map coefficients of A030528, shifted → D
- basis-map coefficients of A030528, shifted → θ+1
- image under θ+1 → (θ+1)² → θ+1
- basis-map coefficients of A021012 → θ+1 → (θ+1)²
- basis-map coefficients of A030528, shifted → D → (θ+1)²
- basis-map coefficients of A112227 → (θ+1)² → D
- A131431 → θ+1 → reverse
- basis-map coefficients of A297191, shifted → (θ+1)² → θ+1
- A038338 → γ
- A131431 → θ+1 → D
- A132774 → Veronese 2 (j=1) → D
- A127773 → D → θ+1
- basis-map coefficients of A scaled Hermite triangle.
- basis-map coefficients of A297191, shifted → D → θ+1
- hadamard_factor parent of Triangle read by rows: row n consists of n-1 zeros followed by n(n+1)/2.
- image under θ+1 → (θ+1)² → reverse
- A023531: a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
- A131436 → (θ+1)²
- A127648 → D
- basis-map coefficients of A030528, shifted → reverse
- basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
- A127773 → D → D
- basis-map coefficients of Triangle read by rows: T(n,k) = binomial(k,n-k). shifted by x -> -x + 0
- basis-map coefficients of A026729, shifted → (θ+1)² → D
- A131431 → (θ+1)²
- A127773 → (θ+1)²
- A131431 → D → θ+1
- A010054: a(n) = 1 if n is a triangular number, otherwise 0.
- basis-map coefficients of A026729, shifted → θ+1 → reverse
- basis-map coefficients of A021012 → (θ+1)²
- A344565 → γ
- A127773 → reverse
- basis-map coefficients of A026729, shifted → D
- basis-map coefficients of A112227 → θ+1 → D
- A130123 → D → D
- A131431 → D
- basis-map coefficients of A026729, shifted → (θ+1)² → (θ+1)²
- A127733: Triangle read by rows: n-th row is n^2 preceded by (n-1) zeros.
- A131436: Triangle read by rows, (n-1) zeros followed by 2^n - 1.
- A131431 → reverse
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.