A036969 → x ↦ x+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1213
277115
33752171107
42644732433411015
524335263362985760112243
6279137018060270203782472971181311
73869061103781113048249762890015613914713215099
86346119201963992393896912953478318007332866613594212166957511
91211593734244386725697700033652040431141198261640995110306822751029411612160355
102655174768101322770211516086151711214751490426578728480283662970849065285888851789395144305448847
116602890363327221368398344844012088937543671165116840670741939617042923464837330326374852971732219189451711375062557963
12184557910099381641188023441466166632657213685846544500707239966440020078878514223001310039942277420211286771305516563195155221662147761287928471
13575068472621622713979156454335270523554753645420852025299123170059997669301057309849672501945432120396218996556667949677294885725732649803566777525151183211842232664651763
141983312152411351993753119542243920729782720730385232693364894383481518307500578770258262750354695641283330175314712156278335668684102782758843983641906107976988475637723866263933021029178379570637994975
Technical details
Node id
n-e2d562c238cc12f3 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-73fe859bd5ab53a7

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:         2,         1;
  2:         7,         7,         1;
  3:        37,        52,        17,         1;
  4:       264,       473,       243,        34,         1;
  5:      2433,      5263,      3629,       857,        60,        1;
  6:     27913,     70180,     60270,     20378,      2472,       97,       1;
  7:    386906,   1103781,   1130482,    497628,     90015,     6139,     147,     1;
  8:   6346119,  20196399,  23938969,  12953478,   3180073,   328666,   13594,   212,   1;
  9: 121159373, 424438672, 569770003, 365204043, 114119826, 16409951, 1030682, 27510, 294, 1;
%F Formula
The row polynomials satisfy P(n,x) = (2+x)*P(n-1,x) + (3+3*x)*d/dx P(n-1,x) + (1+2*x+x^2)*d^2/dx^2 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[(2 + x)*P[n - 1, x] + (3 + 3*x)*D[P[n - 1, x], x] + (1 + 2*x + x^2)*D[P[n - 1, x], {x, 2}]];
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] = (2 + x)*v[i - 1] + (3 + 3*x)*deriv(v[i - 1], x) + (1 + 2*x + x^2)*deriv(deriv(v[i - 1], x), x)); 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.