A013611 → basis A008288
nonnegative coefficients
Proved for all n: all roots real, in [−3−2√2, −3+2√2] · 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 | 5 | 4 | 9 | |||||||||||||
| 2 | 25 | 56 | 16 | 97 | ||||||||||||
| 3 | 125 | 476 | 368 | 64 | 1033 | |||||||||||
| 4 | 625 | 3376 | 4704 | 2048 | 256 | 11009 | ||||||||||
| 5 | 3125 | 21876 | 45600 | 35200 | 10496 | 1024 | 117321 | |||||||||
| 6 | 15625 | 134376 | 378096 | 439808 | 227072 | 51200 | 4096 | 1250273 | ||||||||
| 7 | 78125 | 796876 | 2840592 | 4522432 | 3491584 | 1336320 | 241664 | 16384 | 13323977 | |||||||
| 8 | 390625 | 4609376 | 19953088 | 40835072 | 43181568 | 24453120 | 7389184 | 1114112 | 65536 | 141991681 | ||||||
| 9 | 1953125 | 26171876 | 133515584 | 336297728 | 459240960 | 354662400 | 156975104 | 39059456 | 5046272 | 262144 | 1513184649 | |||||
| 10 | 9765625 | 146484376 | 861328080 | 2587110400 | 4374749696 | 4360851456 | 2616991744 | 945356800 | 199557120 | 22544384 | 1048576 | 16125788257 | ||||
| 11 | 48828125 | 810546876 | 5400390576 | 18888673088 | 38336307712 | 47401687040 | 36616429568 | 17828511744 | 5422252032 | 992739328 | 99614720 | 4194304 | 171850175113 | |||
| 12 | 244140625 | 4443359376 | 33095703072 | 132333985792 | 314744114944 | 468448092160 | 448550584320 | 280113905664 | 114194055168 | 29927407616 | 4833935360 | 436207616 | 16777216 | 1831382268929 | ||
| 13 | 1220703125 | 24169921876 | 199072265568 | 896748048512 | 2452783171328 | 4292692270080 | 4950833971200 | 3825140367360 | 1992450834432 | 696443994112 | 160128040960 | 23127392256 | 1895825408 | 67108864 | 19516773915081 | |
| 14 | 6103515625 | 130615234376 | 1178955078064 | 5912255861248 | 18317978476800 | 37001975224320 | 50254397091840 | 46736215572480 | 30045663068160 | 13369158926336 | 4081503436800 | 835102703616 | 109035126784 | 8187281408 | 268435456 | 207987415033313 |
Computed in your browser ?
Technical details
- Node id
n-215b7d121fbc1e4b· revision 2 · JSON- Definition source
derived:basis_map_A008288- Fingerprint
f6-32550b608f1e0aa0
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 ?
No OEIS matches.
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: 5, 4; 2: 25, 56, 16; 3: 125, 476, 368, 64; 4: 625, 3376, 4704, 2048, 256; 5: 3125, 21876, 45600, 35200, 10496, 1024; 6: 15625, 134376, 378096, 439808, 227072, 51200, 4096; 7: 78125, 796876, 2840592, 4522432, 3491584, 1336320, 241664, 16384; 8: 390625, 4609376, 19953088, 40835072, 43181568, 24453120, 7389184, 1114112, 65536; 9: 1953125, 26171876, 133515584, 336297728, 459240960, 354662400, 156975104, 39059456, 5046272, 262144;
%F FormulaThe row polynomials satisfy P(n,x) = -(5-12*x)*P(n-2,x) + (6+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 5 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(5 - 12*x)*P[n - 2, x] + (6 + 4*x)*P[n - 1, 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] = 5 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(5 - 12*x)*v[i - 2] + (6 + 4*x)*v[i - 1]); 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 [-1564556493/268435456, -46056243/268435456]
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-1d35ea8dc489f8c6 -
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-1d35ea8dc489f8c6,e-cfd0ddf0ef7532e7 -
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-1d35ea8dc489f8c6,e-cfd0ddf0ef7532e7 -
Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in [−3−2√2, −3+2√2] (rational outer bound [-1564556493/268435456, -46056243/268435456])
Every polynomial of the sequence has only real roots, inside the stated interval.by the cited steps:
e-cfd0ddf0ef7532e7
Proof chains
2 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
-
basis_map A008288
e-1d35ea8dc489f8c6Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [-1, 0]
-
preserver_image mobius, shift 0
e-db5094ba61234decAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-035d18f235569c81root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A013610
e-404109e50a21afd4Geometric 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.
-
preserver_image reversal, shift 0
e-b03bb7746bf562deAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-2786234a932620b2root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-090c65763405a203Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-035d18f235569c81(expanded above) -
↵ basis_map A013610
e-404109e50a21afd4(expanded above) -
parent_provers periodic_product
e-bd3566bc3465f71broot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-33c9dd76a325511aAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-a6866143cc223753root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A013609
e-41b2234a78052e4fGeometric 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]
-
premise (sequence):
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.
-
gamma_polynomial scale 1, shift 0
e-4c4f74d9ba733cffGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-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-eab26daf7024ea74root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.
-
preserver_image reversal, shift 0
e-6d15baf5e54583eeAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-0d085d05819c04f2root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-045f9d56b54ceaf2Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-a6866143cc223753(expanded above) -
↵ basis_map A013609
e-41b2234a78052e4f(expanded above) -
↵ gamma_polynomial scale 1, shift 0
e-4c4f74d9ba733cff(expanded above) -
parent_provers periodic_product
e-d08b7f9df01d4f3croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-2c323256b27180b8Affine, 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-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]
-
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
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
-
parent_provers periodic_product
e-1697ba43e31b7729root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-4608a916413bc814Geometric basis map (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) -
↵ 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 affine, shift 0
e-17c52917511dc051Affine, 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) -
↵ 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):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
-
↵ parent_provers periodic_product
e-d08b7f9df01d4f3c(expanded above) -
↵ preserver_image mobius, shift 0
e-2c323256b27180b8(expanded above)
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+2*x)^n.
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
-
parent_provers periodic_product
e-58678fea8a24dd74root: theorem checkParent-row provers of polytool polytool ?
-
basis_map A007318
e-7b97c40e19745577Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-0d085d05819c04f2(expanded above) -
↵ preserver_image reversal, shift 0
e-045f9d56b54ceaf2(expanded above) -
↵ parent_provers periodic_product
e-1697ba43e31b7729(expanded above) -
↵ basis_map A007318
e-4608a916413bc814(expanded above) -
↵ preserver_image affine, shift 0
e-17c52917511dc051(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
-
preserver_image affine, shift 0
e-4b09f87a5a93f62bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-0d085d05819c04f2(expanded above) -
↵ preserver_image reversal, shift 0
e-045f9d56b54ceaf2(expanded above) -
↵ parent_provers periodic_product
e-1697ba43e31b7729(expanded above) -
↵ basis_map A007318
e-4608a916413bc814(expanded above) -
↵ preserver_image affine, shift 0
e-17c52917511dc051(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle whose (i,j)-th entry is binomial(i,j)*2^(i-j).
-
-
premise (sequence):
Cube of lower triangular normalized binomial matrix.
-
↵ parent_provers periodic_product
e-bd3566bc3465f71b(expanded above) -
↵ preserver_image mobius, shift 0
e-33c9dd76a325511a(expanded above)
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+3*x)^n.
-
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^n.
-
basis_map A008288
e-cfd0ddf0ef7532e7Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ?
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in [-1, 0]
-
premise (sequence):
Triangle of coefficients in expansion of (1+4x)^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
- [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