A088617 → reverse

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2112
32316
45106122
514353010190
64212614070151394
71324626304201402111806
842917162772231010502522818558
91430643512012120126930231042036141586
10486224310514806006042042180184620660451206098
1116796923782187902917202402401261264204285809905511037718
125878635271692378013856701312740816816336336900901501514306615293446
1320801213520783879876646646069283504988412245044881681618018025025200278127297738
147429005200300162249362974571635565530290990701662804066512161837836340340400402730911142078746
1526744402005830067603900135207800178474296163601438106696590498841201662804038798766126126188036401051745387038
Technical details
Node id
n-df818498d48ea142 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-3d0fbbfa79b3fd61

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 -1)
  • 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;
   2:    1,     1;
   3:    2,     3,     1;
   4:    5,    10,     6,     1;
   5:   14,    35,    30,    10,     1;
   6:   42,   126,   140,    70,    15,     1;
   7:  132,   462,   630,   420,   140,    21,    1;
   8:  429,  1716,  2772,  2310,  1050,   252,   28,   1;
   9: 1430,  6435, 12012, 12012,  6930,  2310,  420,  36,  1;
  10: 4862, 24310, 51480, 60060, 42042, 18018, 4620, 660, 45, 1;
%F Formula
The row polynomials satisfy n*P(n,x) = (4*n-6+(3*n-4)*x)*P(n-1,x) - (2*x+2*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((4*n - 6 + (3*n - 4)*x)*P[n - 1, x] - (2*x + 2*x^2)*D[P[n - 1, x], x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((4*n - 6 + (3*n - 4)*x)*v[i - 1] - (2*x + 2*x^2)*deriv(v[i - 1], x))/(n)); 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

Same fingerprint ?

References

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