A120910 → basis A013611 → x ↦ x+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(7 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 3\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 3 | 3 | |||||||
| 1 | 21 | 12 | 33 | ||||||
| 2 | 147 | 168 | 48 | 363 | |||||
| 3 | 1029 | 1764 | 1008 | 192 | 3993 | ||||
| 4 | 7203 | 16464 | 14112 | 5376 | 768 | 43923 | |||
| 5 | 50421 | 144060 | 164640 | 94080 | 26880 | 3072 | 483153 | ||
| 6 | 352947 | 1210104 | 1728720 | 1317120 | 564480 | 129024 | 12288 | 5314683 | |
| 7 | 2470629 | 9882516 | 16941456 | 16134720 | 9219840 | 3161088 | 602112 | 49152 | 58461513 |
Compute more
?
Technical details
- Node id
n-eae311e6cee1a668· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-d36c4f1a2e9bd6b7
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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 3; 1: 21, 12; 2: 147, 168, 48; 3: 1029, 1764, 1008, 192; 4: 7203, 16464, 14112, 5376, 768; 5: 50421, 144060, 164640, 94080, 26880, 3072; 6: 352947, 1210104, 1728720, 1317120, 564480, 129024, 12288; 7: 2470629, 9882516, 16941456, 16134720, 9219840, 3161088, 602112, 49152; 8: 17294403, 79060128, 158120256, 180708864, 129077760, 59006976, 16859136, 2752512, 196608; 9: 121060821, 622598508, 1423082304, 1897443072, 1626379776, 929359872, 354041856, 86704128, 12386304, 786432;
%F FormulaThe row polynomials satisfy P(n,x) = (7+4*x)*P(n-1,x) for n >= 1, with P(0,x) = 3.
%t MathematicaP[0, x_] := 3;
P[n_, x_] := P[n, x] = Expand[(7 + 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] = 3; for(n = 1, N, my(i = n + 1); v[i] = (7 + 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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subw…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
-
from
Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subwords of maximal lengt…?
-
-
from
Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, 0 <= k <= n-1). A lev…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, …?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k levels (n >= 1, …?
-
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) is the number of ternary words of length n having k runs (i.e., subw…?
Related ?
Same fingerprint ?
- A038291 → basis A013611 → basis A013609
- A038328 → basis A013611 → D
- A038330 → basis A013610 → x ↦ x/(x+1)
- A038329 → basis A013609 → basis A013609
- A038328 → basis A013611 → reverse
- A038334 → x ↦ x+1 → basis A013609
- A038255 → basis A013611
- A038335 → x ↦ x/(x+1)
- A038255 → basis A013611 → D
- A038328 → basis A013611
- A013610 → basis A007318 → x ↦ x/(x+1)
- A038284 → x ↦ x/(x+1)
- A038255 → basis A013611 → reverse
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [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
- [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.