A290596 → x ↦ x+1

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(3 + x\right)\,P_{n-1}(x) + \left(12 + 6\,x\right)\,P_{n-1}'(x) + \left(9 + 9\,x\right)\,P_{n-1}''(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2314
32112134
4225171271424
5321329526664816880
65705160345173701830751136672
71207953142851649369567680409510813202048
829652561384545071536740125732352044358001147186260288
Technical details
Node id
n-42681aa94fdb77b6 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-3847c4c478bf2769

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:           3,           1;
   3:          21,          12,           1;
   4:         225,         171,          27,          1;
   5:        3213,        2952,         666,         48,         1;
   6:       57051,       60345,       17370,       1830,        75,        1;
   7:     1207953,     1428516,      493695,      67680,      4095,      108,       1;
   8:    29652561,    38454507,    15367401,    2573235,    204435,     8001,     147,     1;
   9:   827024985,  1160128656,   522635652,  102737376,  10052910,   519120,   14196,   192,   1;
  10: 25810060563, 38766698577, 19331741556, 4341816108, 502587666, 32111478, 1161972, 23436, 243, 1;
%F Formula
The row polynomials satisfy P(n,x) = (3+x)*P(n-1,x) + (12+6*x)*d/dx P(n-1,x) + (9+9*x)*d^2/dx^2 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[(3 + x)*P[n - 1, x] + (12 + 6*x)*D[P[n - 1, x], x] + (9 + 9*x)*D[P[n - 1, x], {x, 2}]];
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] = (3 + x)*v[i - 1] + (12 + 6*x)*deriv(v[i - 1], x) + (9 + 9*x)*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, v[i])))};
T(10)

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