A038231 → D → D

nonnegative coefficientsonly rational roots

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel

Recurrence

\(\left(-2 + n\right)\,P_{n}(x) = \left(4\,n + n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 2\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12Pn(1)
00
10
222
324630
41929612300
51280960240202500
67680768028804803018750
7430085376026880672084042131250
82293763440642150407168013440134456875000
9117964820643841548288645120161280241922016725625000
1058982401179648010321920516096016128003225604032028809035156250
1128835840648806406488064037847040141926403548160591360633603960110214843750
1213841203234603008038928384025952256011354112034062336709632010137609504052801321289062500
136543114241799356416224919552016868966408434483202952069127380172813178880164736013728068641567617187500
1430534533129160359936125954949121049624576059041382402361655296688816128147603456230630402562560192192873618244433593750
Technical details
Node id
n-15850e47aea7175f · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-03d7b8417365c509

Observed on the stored rows ?

  • Degrees: -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 (affine: slope 1, intercept -2)
  • 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 Example
Triangle begins:
  0:       0;
  1:       0;
  2:       2;
  3:      24,       6;
  4:     192,      96,      12;
  5:    1280,     960,     240,     20;
  6:    7680,    7680,    2880,    480,     30;
  7:   43008,   53760,   26880,   6720,    840,    42;
  8:  229376,  344064,  215040,  71680,  13440,  1344,   56;
  9: 1179648, 2064384, 1548288, 645120, 161280, 24192, 2016, 72;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (4*n+n*x)*P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 2.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((4*n + n*x)*P[n - 1, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 2; for(n = 3, N, my(i = n + 1); v[i] = ((4*n + n*x)*v[i - 1])/(n - 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

Proof chains ? JSON

Same fingerprint ?

References

  1. [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
  2. [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
  3. [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
  4. [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
  5. [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
  6. [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
  7. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.