A145596 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n: all roots real, in [−1, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 4 | 6 | ||||||
| 2 | 3 | 14 | 14 | 31 | |||||
| 3 | 4 | 32 | 72 | 48 | 156 | ||||
| 4 | 5 | 60 | 225 | 330 | 165 | 785 | |||
| 5 | 6 | 100 | 550 | 1320 | 1430 | 572 | 3978 | ||
| 6 | 7 | 154 | 1155 | 4004 | 7007 | 6006 | 2002 | 20335 | |
| 7 | 8 | 224 | 2184 | 10192 | 25480 | 34944 | 24752 | 7072 | 104856 |
Generated b-files: A259476 ?
Computed in your browser ?
Technical details
- Node id
n-d37595541a708e8b· revision 1 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-db69b92786c145d5
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 ?
- A259476: triangle, 66 terms agree, 11 full rows row-aligned (tabl) OEIS nonn · view at the OEIS · generated b-file 990 terms from n = 4 ?
- A065096: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.
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, 4; 2: 3, 14, 14; 3: 4, 32, 72, 48; 4: 5, 60, 225, 330, 165; 5: 6, 100, 550, 1320, 1430, 572; 6: 7, 154, 1155, 4004, 7007, 6006, 2002; 7: 8, 224, 2184, 10192, 25480, 34944, 24752, 7072; 8: 9, 312, 3822, 22932, 76440, 148512, 167076, 100776, 25194; 9: 10, 420, 6300, 47040, 199920, 514080, 813960, 775200, 406980, 90440;
%F FormulaThe row polynomials satisfy (n^2+4*n+(2*n^2+8*n)*x+(n^2+4*n)*x^2)*P(n,x) = (n^2+5*n+4+(4*n^2+20*n+16)*x+(5*n^2+25*n+20)*x^2+(2*n^2+10*n+8)*x^3)*P(n-1,x) + ((2*n+2)*x+(6*n+6)*x^2+(6*n+6)*x^3+(2*n+2)*x^4)*d/dx 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^2 + 5*n + 4 + (4*n^2 + 20*n + 16)*x + (5*n^2 + 25*n + 20)*x^2 + (2*n^2 + 10*n + 8)*x^3)*P[n - 1, x] + ((2*n + 2)*x + (6*n + 6)*x^2 + (6*n + 6)*x^3 + (2*n + 2)*x^4)*D[P[n - 1, x], x])/(n^2 + 4*n + (2*n^2 + 8*n)*x + (n^2 + 4*n)*x^2)]];
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^2 + 5*n + 4 + (4*n^2 + 20*n + 16)*x + (5*n^2 + 25*n + 20)*x^2 + (2*n^2 + 10*n + 8)*x^3)*v[i - 1] + ((2*n + 2)*x + (6*n + 6)*x^2 + (6*n + 6)*x^3 + (2*n + 2)*x^4)*deriv(v[i - 1], x))/(n^2 + 4*n + (2*n^2 + 8*n)*x + (n^2 + 4*n)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)Generated with polytool c48629374597.
A259476: triangle, offset 4, from the row P0
%e ExampleTriangle begins: 4: 1; 5: 2, 4; 6: 3, 14, 14; 7: 4, 32, 72, 48; 8: 5, 60, 225, 330, 165; 9: 6, 100, 550, 1320, 1430, 572; 10: 7, 154, 1155, 4004, 7007, 6006, 2002; 11: 8, 224, 2184, 10192, 25480, 34944, 24752, 7072; 12: 9, 312, 3822, 22932, 76440, 148512, 167076, 100776, 25194; 13: 10, 420, 6300, 47040, 199920, 514080, 813960, 775200, 406980, 90440;
%F FormulaThe row polynomials satisfy (n^2-4*n+(2*n^2-8*n)*x+(n^2-4*n)*x^2)*P(n,x) = (n^2-3*n+(4*n^2-12*n)*x+(5*n^2-15*n)*x^2+(2*n^2-6*n)*x^3)*P(n-1,x) + ((2*n-6)*x+(6*n-18)*x^2+(6*n-18)*x^3+(2*n-6)*x^4)*d/dx P(n-1,x) for n >= 5, with P(4,x) = 1.
%t MathematicaP[4, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 - 3*n + (4*n^2 - 12*n)*x + (5*n^2 - 15*n)*x^2 + (2*n^2 - 6*n)*x^3)*P[n - 1, x] + ((2*n - 6)*x + (6*n - 18)*x^2 + (6*n - 18)*x^3 + (2*n - 6)*x^4)*D[P[n - 1, x], x])/(n^2 - 4*n + (2*n^2 - 8*n)*x + (n^2 - 4*n)*x^2)]];
Table[PadRight[CoefficientList[P[n, x], x], n - 3], {n, 4, 13}] // Flatten%o PARI/GPP(N) = {my(v = vector(N - 3)); v[1] = 1; for(n = 5, N, my(i = n - 3); v[i] = ((n^2 - 3*n + (4*n^2 - 12*n)*x + (5*n^2 - 15*n)*x^2 + (2*n^2 - 6*n)*x^3)*v[i - 1] + ((2*n - 6)*x + (6*n - 18)*x^2 + (6*n - 18)*x^3 + (2*n - 6)*x^4)*deriv(v[i - 1], x))/(n^2 - 4*n + (2*n^2 - 8*n)*x + (n^2 - 4*n)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - 3 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i + 3, v[i])))};
T(13)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in [-1, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-a1fbec8352aea886 -
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-a1fbec8352aea886 -
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-a1fbec8352aea886
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 mobius, shift 0
e-a1fbec8352aea886Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-c483eeee9c2638c9root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-1d2c7b4a3cb3d72fAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-c483eeee9c2638c9(expanded above) -
basis_map A007318
e-fb63394f9047a486Geometric basis map (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 1]
-
preserver_image affine, shift 0
e-3babd9179153850cAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
-
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
-
↵ theorem_check liu_wang
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
-
↵ basis_map A007318
e-fb63394f9047a486(expanded above)
-
-
premise (sequence):
basis-map coefficients of Triangular array of generalized Narayana numbers: T(n, k) = 2*binomial(n + 1, k + 1)*binomial…
Related sequences ?
Same fingerprint (2)
Equal up to content, sign, reversal and a small index shift.
References
- [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