A108838 → ⊙ C(n+1,k+1) (shift +1) → D+1
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 1 | 3 | |||||||||||||
| 2 | 5 | 6 | 1 | 12 | ||||||||||||
| 3 | 11 | 30 | 13 | 1 | 55 | |||||||||||
| 4 | 21 | 120 | 110 | 24 | 1 | 276 | ||||||||||
| 5 | 36 | 385 | 700 | 315 | 40 | 1 | 1477 | |||||||||
| 6 | 57 | 1036 | 3430 | 2940 | 770 | 62 | 1 | 8296 | ||||||||
| 7 | 85 | 2436 | 13524 | 20580 | 9996 | 1680 | 91 | 1 | 48393 | |||||||
| 8 | 121 | 5160 | 44856 | 112896 | 95256 | 29232 | 3360 | 128 | 1 | 291010 | ||||||
| 9 | 166 | 10065 | 129690 | 507276 | 698544 | 365904 | 76230 | 6270 | 174 | 1 | 1794320 | |||||
| 10 | 221 | 18370 | 335775 | 1938420 | 4116420 | 3476088 | 1219680 | 181500 | 11055 | 230 | 1 | 11297760 | ||||
| 11 | 287 | 31746 | 794365 | 6488625 | 20244510 | 26162136 | 14638338 | 3633630 | 401115 | 18590 | 297 | 1 | 72413640 | |||
| 12 | 365 | 52416 | 1743742 | 19467448 | 85701759 | 161956080 | 137662668 | 53985360 | 9876867 | 832832 | 30030 | 376 | 1 | 471309944 | ||
| 13 | 456 | 83265 | 3593954 | 53288235 | 320067748 | 850944237 | 1052714520 | 622856091 | 178642464 | 24867843 | 1639638 | 46865 | 468 | 1 | 3108745785 | |
| 14 | 561 | 127960 | 7019740 | 134947176 | 1075238164 | 3892917028 | 6754918170 | 5789929860 | 2489829342 | 539987448 | 58662604 | 3083080 | 70980 | 574 | 1 | 20746732688 |
Computed in your browser ?
Technical details
- Node id
n-8304b53a8f961041· revision 1 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-379b71f8e1339420
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 ℚ): no
OEIS matches ?
- A350265: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
OEIS submission text ?
Fields to paste into an OEIS submission: the example %e, the formula
%F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows.
For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched;
the matched terms were compared with the published ones, which identifies the node with the entry on a
finite prefix, not for every n. The PARI/GP program is not machine-checked here.
The atlas's own rows: n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2, 1; 2: 5, 6, 1; 3: 11, 30, 13, 1; 4: 21, 120, 110, 24, 1; 5: 36, 385, 700, 315, 40, 1; 6: 57, 1036, 3430, 2940, 770, 62, 1; 7: 85, 2436, 13524, 20580, 9996, 1680, 91, 1; 8: 121, 5160, 44856, 112896, 95256, 29232, 3360, 128, 1; 9: 166, 10065, 129690, 507276, 698544, 365904, 76230, 6270, 174, 1;
%F FormulaThe row polynomials satisfy (n^5+7*n^4+11*n^3-n^2+30*n+72+(3*n^4+18*n^3+9*n^2-78*n-72)*x+(3*n^3+19*n^2+22*n-24)*x^2+(n^2+7*n+12)*x^3)*P(n,x) = (n^5+10*n^4+35*n^3+56*n^2+66*n+72+(10*n^5+13*n^4-4*n^3-n^2-66*n-72)*x+(30*n^4+15*n^3-61*n^2-40*n-24)*x^2+(30*n^3+21*n^2-3*n+12)*x^3+(10*n^2+10*n)*x^4)*P(n-1,x) + ((3*n^4+36*n^3+57*n^2+24*n+72)*x-(15*n^4+3*n^3-113*n^2-32*n+84)*x^2-(45*n^3-8*n^2-155*n+24)*x^3-(45*n^2-3*n-24)*x^4-15*n*x^5)*d/dx P(n-1,x) + ((6*n^3+10*n^2+n+12)*x^2+(6*n^3+28*n^2+13*n-12)*x^3+(18*n^2+30*n-18)*x^4+(18*n+12)*x^5+6*x^6)*d^2/dx^2 P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^5 + 10*n^4 + 35*n^3 + 56*n^2 + 66*n + 72 + (10*n^5 + 13*n^4 - 4*n^3 - n^2 - 66*n - 72)*x + (30*n^4 + 15*n^3 - 61*n^2 - 40*n - 24)*x^2 + (30*n^3 + 21*n^2 - 3*n + 12)*x^3 + (10*n^2 + 10*n)*x^4)*P[n - 1, x] + ((3*n^4 + 36*n^3 + 57*n^2 + 24*n + 72)*x - (15*n^4 + 3*n^3 - 113*n^2 - 32*n + 84)*x^2 - (45*n^3 - 8*n^2 - 155*n + 24)*x^3 - (45*n^2 - 3*n - 24)*x^4 - 15*n*x^5)*D[P[n - 1, x], x] + ((6*n^3 + 10*n^2 + n + 12)*x^2 + (6*n^3 + 28*n^2 + 13*n - 12)*x^3 + (18*n^2 + 30*n - 18)*x^4 + (18*n + 12)*x^5 + 6*x^6)*D[P[n - 1, x], {x, 2}])/(n^5 + 7*n^4 + 11*n^3 - n^2 + 30*n + 72 + (3*n^4 + 18*n^3 + 9*n^2 - 78*n - 72)*x + (3*n^3 + 19*n^2 + 22*n - 24)*x^2 + (n^2 + 7*n + 12)*x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((n^5 + 10*n^4 + 35*n^3 + 56*n^2 + 66*n + 72 + (10*n^5 + 13*n^4 - 4*n^3 - n^2 - 66*n - 72)*x + (30*n^4 + 15*n^3 - 61*n^2 - 40*n - 24)*x^2 + (30*n^3 + 21*n^2 - 3*n + 12)*x^3 + (10*n^2 + 10*n)*x^4)*v[i - 1] + ((3*n^4 + 36*n^3 + 57*n^2 + 24*n + 72)*x - (15*n^4 + 3*n^3 - 113*n^2 - 32*n + 84)*x^2 - (45*n^3 - 8*n^2 - 155*n + 24)*x^3 - (45*n^2 - 3*n - 24)*x^4 - 15*n*x^5)*deriv(v[i - 1], x) + ((6*n^3 + 10*n^2 + n + 12)*x^2 + (6*n^3 + 28*n^2 + 13*n - 12)*x^3 + (18*n^2 + 30*n - 18)*x^4 + (18*n + 12)*x^5 + 6*x^6)*deriv(deriv(v[i - 1], x), x))/(n^5 + 7*n^4 + 11*n^3 - n^2 + 30*n + 72 + (3*n^4 + 18*n^3 + 9*n^2 - 78*n - 72)*x + (3*n^3 + 19*n^2 + 22*n - 24)*x^2 + (n^2 + 7*n + 12)*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)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-5336a01b25274fbd -
Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
All coefficients of each polynomial have the same sign (after x -> -x when alternating).derived from the cited steps by a stated theorem:
e-5336a01b25274fbd -
Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.derived from the cited steps by a stated theorem:
e-5336a01b25274fbd
Proof chains
1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
preserver_image derivative_polynomial, shift 0
e-5336a01b25274fbdLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image hadamard_multiplier, shift 1
e-548c39a476f786f5Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle of Dyck paths counted by number of long interior inclines.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check three_term_recurrence
e-a4549745e8cd4154root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
-
premise (sequence):
Triangle of Dyck paths counted by number of long interior inclines.
-
preserver_image reversal, shift 0
e-97ff2ea1491caf9eAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…
-
-
premise (sequence):
Array read by antidiagonals: number of antichains (or order ideals) in the poset 3*m*n or plane partitions with rows <=…
Related sequences ?
No candidate equalities or related sequences.
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023