A391533 → basis A013609 → D+1

nonnegative coefficients

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

Recurrence

\(\left(4 + 7\,x + 2\,x^{2} + 3\,n + 2\,n x\right)\,P_{n}(x) = \left(14 + 32\,x + 22\,x^{2} + 4\,x^{3} + 6\,n + 10\,n x + 4\,n x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 21 + 20\,x + 4\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
02120445
160106568230
2156416388144161120
3384138419041224352325280
491241607648716835368326424320
521121168027008336002400096321920128110080
64800312328723213593612832074240251524352256491520
710752805122639364954885841924453122168326361697285122170880
Technical details
Node id
n-26bc31aa9621d33a · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-0c4ebfc727414b0e

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    21,     20,       4;
  1:    60,    106,      56,       8;
  2:   156,    416,     388,     144,      16;
  3:   384,   1384,    1904,    1224,     352,       32;
  4:   912,   4160,    7648,    7168,    3536,      832,      64;
  5:  2112,  11680,   27008,   33600,   24000,     9632,    1920,     128;
  6:  4800,  31232,   87232,  135936,  128320,    74240,   25152,    4352,     256;
  7: 10752,  80512,  263936,  495488,  584192,   445312,  216832,   63616,    9728,    512;
  8: 23808, 201728,  759808, 1671168, 2369024,  2250752, 1440768,  606208,  156928,  21504,  1024;
  9: 52224, 494080, 2103296, 5308416, 8804352, 10042368, 7999488, 4417536, 1637376, 379392, 47104, 2048;
%F Formula
The row polynomials satisfy (3*n+4+(2*n+7)*x+2*x^2)*P(n,x) = (6*n+14+(10*n+32)*x+(4*n+22)*x^2+4*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 21 + 20*x + 4*x^2.
%t Mathematica
P[0, x_] := 21 + 20*x + 4*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((6*n + 14 + (10*n + 32)*x + (4*n + 22)*x^2 + 4*x^3)*P[n - 1, x])/(3*n + 4 + (2*n + 7)*x + 2*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 21 + 20*x + 4*x^2; for(n = 1, N, my(i = n + 1); v[i] = ((6*n + 14 + (10*n + 32)*x + (4*n + 22)*x^2 + 4*x^3)*v[i - 1])/(3*n + 4 + (2*n + 7)*x + 2*x^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

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.