A178820 → basis A013610 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(4\,n - 6\,n x + 18\,n^{2} x + 9\,n^{3} x^{2}\right)\,P_{n}(x) = \left(24 + 108\,x + 162\,x^{2} + 81\,x^{3} + 8\,n + 144\,n x + 324\,n x^{2} + 189\,n x^{3} + 36\,n^{2} x + 144\,n^{2} x^{2} + 135\,n^{2} x^{3} + 18\,n^{3} x^{2} + 27\,n^{3} x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 8 | 48 | 56 | |||||||||||||
| 2 | 40 | 480 | 810 | 1330 | ||||||||||||
| 3 | 160 | 2880 | 9720 | 8640 | 21400 | |||||||||||
| 4 | 560 | 13440 | 68040 | 120960 | 70875 | 273875 | ||||||||||
| 5 | 1792 | 53760 | 362880 | 967680 | 1134000 | 489888 | 3010000 | |||||||||
| 6 | 5376 | 193536 | 1632960 | 5806080 | 10206000 | 8817984 | 3000564 | 29662500 | ||||||||
| 7 | 15360 | 645120 | 6531840 | 29030400 | 68040000 | 88179840 | 60011280 | 16796160 | 269250000 | |||||||
| 8 | 42240 | 2027520 | 23950080 | 127733760 | 374220000 | 646652160 | 660124080 | 369515520 | 87687765 | 2291953125 | ||||||
| 9 | 112640 | 6082560 | 82114560 | 510935040 | 1796256000 | 3879912960 | 5280992640 | 4434186240 | 2104506360 | 433026000 | 18528125000 | |||||
| 10 | 292864 | 17571840 | 266872320 | 1897758720 | 7783776000 | 20175547392 | 34326452160 | 38429614080 | 27358582680 | 11258676000 | 2043449694 | 143558593750 | ||||
| 11 | 745472 | 49201152 | 830269440 | 6642155520 | 31135104000 | 94152554496 | 192228132096 | 269007298560 | 255346771680 | 157621464000 | 57216591432 | 9285337152 | 1073515625000 | |||
| 12 | 1863680 | 134184960 | 2490808320 | 22140518400 | 116756640000 | 403510947840 | 961140660480 | 1614043791360 | 1915100787600 | 1576214640000 | 858248871480 | 278560114560 | 40865155695 | 7789208984375 | ||
| 13 | 4587520 | 357826560 | 7245987840 | 70849658880 | 415134720000 | 1614043791360 | 4393785876480 | 8608233553920 | 12256645040640 | 12609717120000 | 9154654629120 | 4456961832960 | 1307684982240 | 174992892480 | 55070312500000 | |
| 14 | 11141120 | 935854080 | 20530298880 | 218989854720 | 1411458048000 | 6097498767360 | 18673589975040 | 41811420119040 | 69454321896960 | 85746076416000 | 77814564347520 | 50512234106880 | 22230644698080 | 5949758344320 | 731794257000 | 380673828125000 |
Compute more
?
Technical details
- Node id
n-8fc19771ea009e4e· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-56805ed74e931bf6
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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 8, 48; 2: 40, 480, 810; 3: 160, 2880, 9720, 8640; 4: 560, 13440, 68040, 120960, 70875; 5: 1792, 53760, 362880, 967680, 1134000, 489888; 6: 5376, 193536, 1632960, 5806080, 10206000, 8817984, 3000564; 7: 15360, 645120, 6531840, 29030400, 68040000, 88179840, 60011280, 16796160; 8: 42240, 2027520, 23950080, 127733760, 374220000, 646652160, 660124080, 369515520, 87687765; 9: 112640, 6082560, 82114560, 510935040, 1796256000, 3879912960, 5280992640, 4434186240, 2104506360, 433026000;
%F FormulaThe row polynomials satisfy (4*n+(18*n^2-6*n)*x+9*n^3*x^2)*P(n,x) = (8*n+24+(36*n^2+144*n+108)*x+(18*n^3+144*n^2+324*n+162)*x^2+(27*n^3+135*n^2+189*n+81)*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((8*n + 24 + (36*n^2 + 144*n + 108)*x + (18*n^3 + 144*n^2 + 324*n + 162)*x^2 + (27*n^3 + 135*n^2 + 189*n + 81)*x^3)*P[n - 1, x])/(4*n + (18*n^2 - 6*n)*x + 9*n^3*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((8*n + 24 + (36*n^2 + 144*n + 108)*x + (18*n^3 + 144*n^2 + 324*n + 162)*x^2 + (27*n^3 + 135*n^2 + 189*n + 81)*x^3)*v[i - 1])/(4*n + (18*n^2 - 6*n)*x + 9*n^3*x^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 Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
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) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = C(n+3,3) * C(n,k), 0 <= k <= n.?
Related ?
Same fingerprint ?
- A196347 → basis A013610 → (θ+1)²
- A178822 → basis A013610 → (θ+1)²
- A085880 → basis A013610 → (θ+1)²
- A028326 → basis A013610 → (θ+1)²
- A013620 → (θ+1)²
- A038338 → basis A013610 → (θ+1)²
- A038221 → basis A013610 → (θ+1)²
- A156992 → basis A013610 → (θ+1)²
- A038208 → basis A013610 → (θ+1)²
- A178821 → basis A013610 → (θ+1)²
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.