A007318 → (θ+1)² → 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 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 5 | 6 | |||||||||||||
| 2 | 1 | 10 | 18 | 29 | ||||||||||||
| 3 | 1 | 15 | 54 | 56 | 126 | |||||||||||
| 4 | 1 | 20 | 108 | 224 | 160 | 513 | ||||||||||
| 5 | 1 | 25 | 180 | 560 | 800 | 432 | 1998 | |||||||||
| 6 | 1 | 30 | 270 | 1120 | 2400 | 2592 | 1120 | 7533 | ||||||||
| 7 | 1 | 35 | 378 | 1960 | 5600 | 9072 | 7840 | 2816 | 27702 | |||||||
| 8 | 1 | 40 | 504 | 3136 | 11200 | 24192 | 31360 | 22528 | 6912 | 99873 | ||||||
| 9 | 1 | 45 | 648 | 4704 | 20160 | 54432 | 94080 | 101376 | 62208 | 16640 | 354294 | |||||
| 10 | 1 | 50 | 810 | 6720 | 33600 | 108864 | 235200 | 337920 | 311040 | 166400 | 39424 | 1240029 | ||||
| 11 | 1 | 55 | 990 | 9240 | 52800 | 199584 | 517440 | 929280 | 1140480 | 915200 | 433664 | 92160 | 4290894 | |||
| 12 | 1 | 60 | 1188 | 12320 | 79200 | 342144 | 1034880 | 2230272 | 3421440 | 3660800 | 2601984 | 1105920 | 212992 | 14703201 | ||
| 13 | 1 | 65 | 1404 | 16016 | 114400 | 555984 | 1921920 | 4832256 | 8895744 | 11897600 | 11275264 | 7188480 | 2768896 | 487424 | 49955454 | |
| 14 | 1 | 70 | 1638 | 20384 | 160160 | 864864 | 3363360 | 9664512 | 20756736 | 33313280 | 39463424 | 33546240 | 19382272 | 6823936 | 1105920 | 168466797 |
Generated b-files: A081278 (row sums) ?
Computed in your browser ?
Technical details
- Node id
n-8c39fb67b0147cfb· revision 1 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-12c97c7d57838f47
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 ?
- A081278: 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 ?
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: 1, 5; 2: 1, 10, 18; 3: 1, 15, 54, 56; 4: 1, 20, 108, 224, 160; 5: 1, 25, 180, 560, 800, 432; 6: 1, 30, 270, 1120, 2400, 2592, 1120; 7: 1, 35, 378, 1960, 5600, 9072, 7840, 2816; 8: 1, 40, 504, 3136, 11200, 24192, 31360, 22528, 6912; 9: 1, 45, 648, 4704, 20160, 54432, 94080, 101376, 62208, 16640;
%F FormulaThe row polynomials satisfy (1+3*x+3*x^2+x^3)*P(n,x) = (1+9*x+33*x^2+63*x^3+66*x^4+36*x^5+8*x^6)*P(n-3,x) - (3+21*x+57*x^2+75*x^3+48*x^4+12*x^5)*P(n-2,x) + (3+15*x+27*x^2+21*x^3+6*x^4)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + 5*x, P(2,x) = 1 + 10*x + 18*x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + 5*x;
P[2, x_] := 1 + 10*x + 18*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((1 + 9*x + 33*x^2 + 63*x^3 + 66*x^4 + 36*x^5 + 8*x^6)*P[n - 3, x] - (3 + 21*x + 57*x^2 + 75*x^3 + 48*x^4 + 12*x^5)*P[n - 2, x] + (3 + 15*x + 27*x^2 + 21*x^3 + 6*x^4)*P[n - 1, x])/(1 + 3*x + 3*x^2 + x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 5*x; v[3] = 1 + 10*x + 18*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((1 + 9*x + 33*x^2 + 63*x^3 + 66*x^4 + 36*x^5 + 8*x^6)*v[i - 3] - (3 + 21*x + 57*x^2 + 75*x^3 + 48*x^4 + 12*x^5)*v[i - 2] + (3 + 15*x + 27*x^2 + 21*x^3 + 6*x^4)*v[i - 1])/(1 + 3*x + 3*x^2 + 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 [-1, 0]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-5fe876e73621d007 -
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-5fe876e73621d007 -
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-5fe876e73621d007
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-5fe876e73621d007Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image euler_polynomial, shift 0
e-6f35c326bbf0f62dLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-317eb4ccca60c6acroot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-033cf842aad3bdf7Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
basis_map A007318
e-095baa2a9dfe188fGeometric basis map (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]
-
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.
-
parent_provers periodic_product
e-13983862a411779croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-989c95e5c893fce9Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Riordan array (1-x,x/(1-x)).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-b62074ba45057e82root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Riordan array (1-x,x/(1-x)).
-
gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3deaGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image reversal, shift 0
e-0e058c428dfdfeb6Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-d82c9b48e4b31a6broot: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
↵ parent_provers periodic_product
e-d82c9b48e4b31a6b(expanded above)
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
preserver_image affine, shift 0
e-3a52de7742ed9314Affine, 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.
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
-
premise (sequence):
binomial
-
preserver_image euler_polynomial, shift 0
e-7889e4573c43d5fcLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
preserver_image euler_polynomial, shift 0
e-85c5d5448d617672Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
preserver_image euler_polynomial, shift 0
e-a112169ce63438ebLaguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
preserver_image reversal, shift 0
e-ac2f606fc4a9c0c0Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 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-5c65a1a70531c253Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
preserver_image reversal, shift 0
e-c2af0ae48d7f11c8Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ preserver_image euler_polynomial, shift 0
e-a112169ce63438eb(expanded above) -
preserver_image euler_polynomial, shift 0
e-becc9d9cf02b45c7Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 40] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
↵ preserver_image euler_polynomial, shift 0
-
premise (sequence):
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…
-
preserver_image derivative_polynomial, shift 0
e-d2751b1a8ff0ac45Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
binomial
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-317eb4ccca60c6ac(expanded above) -
↵ preserver_image reversal, shift 0
e-033cf842aad3bdf7(expanded above) -
↵ basis_map A007318
e-095baa2a9dfe188f(expanded above) -
↵ parent_provers periodic_product
e-13983862a411779c(expanded above) -
↵ preserver_image reversal, shift 0
e-989c95e5c893fce9(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-c76adc2a99cd3dea(expanded above) -
↵ preserver_image affine, shift 0
e-3a52de7742ed9314(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
binomial
-
-
premise (sequence):
Array T(m,n) read by ascending antidiagonals: T(m,n) = m*binomial(n+m-2, n-1) for m, n >= 1.
-
↵ preserver_image euler_polynomial, shift 0
e-becc9d9cf02b45c7(expanded above)
-
-
premise (sequence):
Triangle read by rows: n-th row = unsigned coefficients of the characteristic polynomials of an n X n matrix with 2's o…
-
-
premise (sequence):
Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).
Related sequences ?
No candidate equalities or related sequences.
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
- [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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.