A178822 → basis A013609 → x ↦ x+1

nonnegative coefficientsonly rational roots

Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1241236
233633684756
335845376268844812096
4322566451248384161282016163296
52580486451206451203225608064080641959552
6189235256770567096320473088017740803548162956821555072
7129761284541644868124672567705602838528085155841419264101376221709312
Technical details
Node id
n-f6cae63539e48dd7 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-11aec07ce60b6d61

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:         1;
  1:        24,         12;
  2:       336,        336,         84;
  3:      3584,       5376,       2688,        448;
  4:     32256,      64512,      48384,      16128,       2016;
  5:    258048,     645120,     645120,     322560,      80640,       8064;
  6:   1892352,    5677056,    7096320,    4730880,    1774080,     354816,     29568;
  7:  12976128,   45416448,   68124672,   56770560,   28385280,    8515584,   1419264,    101376;
  8:  84344832,  337379328,  590413824,  590413824,  369008640,  147603456,  36900864,   5271552,   329472;
  9: 524812288, 2361655296, 4723310592, 5510529024, 4132896768, 2066448384, 688816128, 147603456, 18450432, 1025024;
%F Formula
The row polynomials satisfy n*P(n,x) = (4*n+20+(2*n+10)*x)*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[((4*n + 20 + (2*n + 10)*x)*P[n - 1, 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] = ((4*n + 20 + (2*n + 10)*x)*v[i - 1])/(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. [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. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.