A124848 → 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(3 - x + n + 2\,n x\right)\,P_{n-1}(x) + \left(-x - x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1415
2108119
3203012163
4358060161192
556175200100201552
6843365254001502411520
7120588117612257002102814048
8165960235231362450112028032110496
922014854320705670564410168036036126624
10286220074251440017640141127350240045040166304
1136431461210027225396003880825872115503300550441162560
124554368188764840081675950407761644352173254400660481393216
135605915283928179615730021235520592014414472072250255720780521940032
146807840414051324962862864404404954954118402522521121123503572809105612224128
Technical details
Node id
n-bdca8d2826fff8ca · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-f91847f627145760

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 Example
Triangle begins:
  0:   1;
  1:   4,    1;
  2:  10,    8,    1;
  3:  20,   30,   12,    1;
  4:  35,   80,   60,   16,    1;
  5:  56,  175,  200,  100,   20,    1;
  6:  84,  336,  525,  400,  150,   24,    1;
  7: 120,  588, 1176, 1225,  700,  210,   28,   1;
  8: 165,  960, 2352, 3136, 2450, 1120,  280,  32,  1;
  9: 220, 1485, 4320, 7056, 7056, 4410, 1680, 360, 36, 1;
%F Formula
The row polynomials satisfy n*P(n,x) = (n+3+(2*n-1)*x)*P(n-1,x) - (x+x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((n + 3 + (2*n - 1)*x)*P[n - 1, x] - (x + x^2)*D[P[n - 1, x], x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((n + 3 + (2*n - 1)*x)*v[i - 1] - (x + 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 - 1, v[i])))};
T(9)

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