A120910 → basis A013609 → basis A013610
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(5 + 6\,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 | 15 | 18 | 33 | ||||||
| 2 | 75 | 180 | 108 | 363 | |||||
| 3 | 375 | 1350 | 1620 | 648 | 3993 | ||||
| 4 | 1875 | 9000 | 16200 | 12960 | 3888 | 43923 | |||
| 5 | 9375 | 56250 | 135000 | 162000 | 97200 | 23328 | 483153 | ||
| 6 | 46875 | 337500 | 1012500 | 1620000 | 1458000 | 699840 | 139968 | 5314683 | |
| 7 | 234375 | 1968750 | 7087500 | 14175000 | 17010000 | 12247200 | 4898880 | 839808 | 58461513 |
Compute more
?
Technical details
- Node id
n-d5a40cb29a976c68· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-da2debf48cb6165b
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: 15, 18; 2: 75, 180, 108; 3: 375, 1350, 1620, 648; 4: 1875, 9000, 16200, 12960, 3888; 5: 9375, 56250, 135000, 162000, 97200, 23328; 6: 46875, 337500, 1012500, 1620000, 1458000, 699840, 139968; 7: 234375, 1968750, 7087500, 14175000, 17010000, 12247200, 4898880, 839808; 8: 1171875, 11250000, 47250000, 113400000, 170100000, 163296000, 97977600, 33592320, 5038848; 9: 5859375, 63281250, 303750000, 850500000, 1530900000, 1837080000, 1469664000, 755827200, 226748160, 30233088;
%F FormulaThe row polynomials satisfy P(n,x) = (5+6*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[(5 + 6*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] = (5 + 6*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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
Proof chains ? JSON
-
Geometric basis map (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 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 runs (i.e., subw…?
Related ?
Same fingerprint ?
- A038334 → basis A013610 → D
- A038291 → basis A013609 → x ↦ x/(x+1)
- A147716 → basis A013610 → x ↦ x/(x+1)
- A038220 → basis A013610 → D
- A038271 → basis A013609 → D
- A038259 → D
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*10^j.
- A038334 → basis A013610 → reverse
- A013612 → x ↦ x+1
- A038329 → x ↦ x+1 → x ↦ x/(x+1)
- A178820 → basis A013610 → basis A013609
- A196347 → basis A013610 → basis A013609
- A178821 → basis A013610 → basis A013609
- A156992 → basis A013610 → basis A013609
- A038338 → basis A013610 → basis A013609
- A085880 → basis A013610 → basis A013609
- A013612 → x ↦ x+1 → D
- A038336 → D
- A038220 → basis A013610
- A038221 → basis A013610 → basis A013609
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*12^j.
- A038334 → basis A013610
- A028326 → basis A013610 → basis A013609
- A038314 → D
- A038271 → basis A013609
- A013612 → x ↦ x+1 → reverse
- A178822 → basis A013610 → basis A013609
- A038259: Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*5^j.
- A038255 → basis A013610 → basis A013611
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.