Veronese parent of A098172 → D+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14x15x16x17x18x19x20x21x22Pn(1)
1112
2003519
300005139128
40000007253013176
5000000009417054171192
60000000000116113515085211464
700000000000013852313352751232511088
800000000000000151133646517004551682912496
Technical details
Node id
n-220c6973448e8e72 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-19afff2b02650d12

Observed on the stored rows ?

  • Degrees: 1, 4, 7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43 (affine: slope 3, 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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1, 1;
   2: 0, 0, 3, 5, 1;
   3: 0, 0, 0, 0, 5, 13, 9,  1;
   4: 0, 0, 0, 0, 0,  0, 7, 25, 30, 13,  1;
   5: 0, 0, 0, 0, 0,  0, 0,  0,  9, 41, 70, 54,  17,   1;
   6: 0, 0, 0, 0, 0,  0, 0,  0,  0,  0, 11, 61, 135, 150,  85,  21,   1;
   7: 0, 0, 0, 0, 0,  0, 0,  0,  0,  0,  0,  0,  13,  85, 231, 335, 275, 123,  25,    1;
   8: 0, 0, 0, 0, 0,  0, 0,  0,  0,  0,  0,  0,   0,   0,  15, 113, 364, 651, 700,  455,  168,   29,    1;
   9: 0, 0, 0, 0, 0,  0, 0,  0,  0,  0,  0,  0,   0,   0,   0,   0,  17, 145, 540, 1148, 1526, 1302,  700,  220,   33,    1;
  10: 0, 0, 0, 0, 0,  0, 0,  0,  0,  0,  0,  0,   0,   0,   0,   0,   0,   0,  19,  181,  765, 1884, 2982, 3150, 2226, 1020, 279, 37, 1;
%F Formula
The row polynomials satisfy (2*n-3+(3*n-4)*x+x^2)*P(n,x) = ((2*n-1)*x^2+(5*n-2)*x^3+3*n*x^4+x^5)*P(n-1,x) for n >= 2, with P(1,x) = 1 + x.
%t Mathematica
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[Together[(((2*n - 1)*x^2 + (5*n - 2)*x^3 + 3*n*x^4 + x^5)*P[n - 1, x])/(2*n - 3 + (3*n - 4)*x + x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1 + x; for(n = 2, N, my(i = n); v[i] = (((2*n - 1)*x^2 + (5*n - 2)*x^3 + 3*n*x^4 + x^5)*v[i - 1])/(2*n - 3 + (3*n - 4)*x + x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

References

  1. [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
  2. [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
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.