A152198 → basis A013611 → 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(6 + 12\,x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 1 | |||||||
| 2 | 6 | 12 | 18 | ||||||
| 3 | 6 | 12 | 18 | ||||||
| 4 | 36 | 144 | 144 | 324 | |||||
| 5 | 36 | 144 | 144 | 324 | |||||
| 6 | 216 | 1296 | 2592 | 1728 | 5832 | ||||
| 7 | 216 | 1296 | 2592 | 1728 | 5832 | ||||
| 8 | 1296 | 10368 | 31104 | 41472 | 20736 | 104976 | |||
| 9 | 1296 | 10368 | 31104 | 41472 | 20736 | 104976 | |||
| 10 | 7776 | 77760 | 311040 | 622080 | 622080 | 248832 | 1889568 | ||
| 11 | 7776 | 77760 | 311040 | 622080 | 622080 | 248832 | 1889568 | ||
| 12 | 46656 | 559872 | 2799360 | 7464960 | 11197440 | 8957952 | 2985984 | 34012224 | |
| 13 | 46656 | 559872 | 2799360 | 7464960 | 11197440 | 8957952 | 2985984 | 34012224 | |
| 14 | 279936 | 3919104 | 23514624 | 78382080 | 156764160 | 188116992 | 125411328 | 35831808 | 612220032 |
Compute more
?
Technical details
- Node id
n-8255953095b1a53a· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-98cc1557e904900a
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1; 1: 1; 2: 6, 12; 3: 6, 12; 4: 36, 144, 144; 5: 36, 144, 144; 6: 216, 1296, 2592, 1728; 7: 216, 1296, 2592, 1728; 8: 1296, 10368, 31104, 41472, 20736; 9: 1296, 10368, 31104, 41472, 20736;
%F FormulaThe row polynomials satisfy P(n,x) = (6+12*x)*P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(6 + 12*x)*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] = 1; for(n = 2, N, my(i = n + 1); v[i] = (6 + 12*x)*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)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_A013611 of Triangle read by rows, A007318 rows repeated.?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Triangle read by rows, A007318 rows repeated.?
Related ?
Same fingerprint ?
- A103633 → x ↦ x/(x+1)
- A152198 → basis A013611 → D
- A274496 → basis A013611 → D
- A152198 → basis A013609 → basis A007318
- A152198 → basis A013611
- A274496 → D → x ↦ x+1
- A152198 → x ↦ x+1
- A188440 → basis A013610
- A274496 → basis A013611 → basis A013610
- A152198 → x ↦ x+1 → D
- A274498 → D
- A274496 → x ↦ x+1
- A188440: Triangle T(n,k) read by rows: number of size-k antisymmetric subsets of {1,2,...,n}.
- A274498: Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k…
- A188440 → D
- A274496 → basis A013611
- A274498 → basis A013610
- A274498 → D → D
- A152198 → basis A013609 → 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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.