A132774: A natural number operator.
A023531 → 2D+1+2n
A132774 nonnegative coefficients only rational roots
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 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 3 | 5 | |||||||||||||
| 2 | 0 | 4 | 5 | 9 | ||||||||||||
| 3 | 0 | 0 | 6 | 7 | 13 | |||||||||||
| 4 | 0 | 0 | 0 | 8 | 9 | 17 | ||||||||||
| 5 | 0 | 0 | 0 | 0 | 10 | 11 | 21 | |||||||||
| 6 | 0 | 0 | 0 | 0 | 0 | 12 | 13 | 25 | ||||||||
| 7 | 0 | 0 | 0 | 0 | 0 | 0 | 14 | 15 | 29 | |||||||
| 8 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 16 | 17 | 33 | ||||||
| 9 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 18 | 19 | 37 | |||||
| 10 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 20 | 21 | 41 | ||||
| 11 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 22 | 23 | 45 | |||
| 12 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 24 | 25 | 49 | ||
| 13 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 26 | 27 | 53 | |
| 14 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 28 | 29 | 57 |
Generated b-files: A004766 (row sums), A016813 (row sums), A132774 ?
Computed in your browser ?
Other recurrences
X ↦ x/(x+1) substitution · proved equal for all n (proof step)
Technical details
- Node id
n-f4c1dee76f5a68b2· revision 2 · JSON- Definition source
oeis_catalog:A132774derived:mobius_x_over_x_plus_one(equal bye-2429e27d4b998677)- Fingerprint
f6-ccfaa2b0b0cc2c4e
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
OEIS matches ?
- A222945: row sums, 13 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
- A016813: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
- A004766: row sums, 14 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?
- A132774: triangle, 78 terms agree, 12 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 1 ?
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, 3; 2: 0, 4, 5; 3: 0, 0, 6, 7; 4: 0, 0, 0, 8, 9; 5: 0, 0, 0, 0, 10, 11; 6: 0, 0, 0, 0, 0, 12, 13; 7: 0, 0, 0, 0, 0, 0, 14, 15; 8: 0, 0, 0, 0, 0, 0, 0, 16, 17; 9: 0, 0, 0, 0, 0, 0, 0, 0, 18, 19;
%F FormulaThe row polynomials satisfy P(n,x) = 2*x*P(n-1,x) - x^2*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 3*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 3*x;
P[n_, x_] := P[n, x] = Expand[2*x*P[n - 1, x] - x^2*P[n - 2, 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] = 2 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = 2*x*v[i - 1] - x^2*v[i - 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.
A132774: triangle, offset 1, from the row P0
%e ExampleTriangle begins: 1: 1; 2: 2, 3; 3: 0, 4, 5; 4: 0, 0, 6, 7; 5: 0, 0, 0, 8, 9; 6: 0, 0, 0, 0, 10, 11; 7: 0, 0, 0, 0, 0, 12, 13; 8: 0, 0, 0, 0, 0, 0, 14, 15; 9: 0, 0, 0, 0, 0, 0, 0, 16, 17; 10: 0, 0, 0, 0, 0, 0, 0, 0, 18, 19;
%F FormulaThe row polynomials satisfy P(n,x) = 2*x*P(n-1,x) - x^2*P(n-2,x) for n >= 3, with P(1,x) = 1, P(2,x) = 2 + 3*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 2 + 3*x;
P[n_, x_] := P[n, x] = Expand[2*x*P[n - 1, x] - x^2*P[n - 2, x]];
Table[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + 3*x; for(n = 3, N, my(i = n); v[i] = 2*x*v[i - 1] - x^2*v[i - 2]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)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-3fa49e62bb44b5e9 -
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-3fa49e62bb44b5e9,e-cbd96c681ac3cbdc -
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-3fa49e62bb44b5e9,e-cbd96c681ac3cbdc -
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-cbd96c681ac3cbdc
Proof chains
3 incoming proof steps. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON
-
definition_equality
e-2429e27d4b998677root: theorem checkOre-algebra identity of two definitions polytool ?
-
preserver_image derivative_polynomial, shift 0
e-3fa49e62bb44b5e9Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
veronese_section r=2, j=0, shift 0
e-292206ad4ae86d2dVeronese sections of Pólya frequency sequences [ASW52; Edr53; AW24] polytool ?
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-1991a148b9538b93root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-12303ad0e0b9f8ebAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
-
-
premise (sequence):
basis-map coefficients of Irregular triangle read by rows formed by taking every other row of the Delannoy array (A0082…
-
parent_provers periodic_product
e-b7eca039219a7f53root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-7e44b66e04c497d6Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
preserver_image mobius, shift 0
e-cbd96c681ac3cbdcAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, (n-1) zeros followed by (2n, 1).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image derivative_polynomial, shift 0
e-224384a428b81acfLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
-
premise (sequence):
Triangle read by rows, (n-1) zeros followed by (2n, 1).
Used in 9 proof steps
e-407378711040f171preserver_image (reversal, shift 0) → reversal of A natural number operator.e-6bcbf7b7ae614aa0preserver_image (mobius, shift 0) → mobius_x_over_x_plus_one of A natural number operator.e-8542387066f5b9c7preserver_image (affine, shift 0) → shift_x_plus_one of A natural number operator.e-9cac8cec827e3b4dpreserver_image (euler_polynomial, shift 0) → theta_plus_one of A natural number operator.e-a74b39c9c6ecbce0preserver_image (derivative_polynomial, shift 0) → derivative of A natural number operator.e-bd5898d8db51b1b7preserver_image (euler_polynomial, shift 0) → theta_plus_one_squared of A natural number operator.e-c42e136a1c0028cdpreserver_image (derivative_polynomial, shift 0) → one_plus_derivative of A natural number operator.e-611716aca3d048f2veronese_section (r=2, j=1, shift 0) → veronese_section_2_1 of A natural number operator.e-bf26e3fe4e7c28abveronese_section (r=2, j=0, shift 0) → veronese_section_2_0 of A natural number operator.
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.