A274496 → basis A013610 → basis A008277

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3Pn(1)
011
122
210616
3201232
410015636292
520031272584
61000309617282166040
720006192345643212080
Technical details
Node id
n-6364333ec046b88e · revision 0 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-32bac27798a7a126

Observed on the stored rows ?

  • Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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;
  2:    10,      6;
  3:    20,     12;
  4:   100,    156,     36;
  5:   200,    312,     72;
  6:  1000,   3096,   1728,   216;
  7:  2000,   6192,   3456,   432;
  8: 10000,  55536,  56592, 16416, 1296;
  9: 20000, 111072, 113184, 32832, 2592;
%F Formula
The row polynomials satisfy P(n,x) = (10+6*x)*P(n-2,x) + 6*x*d/dx P(n-2,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[(10 + 6*x)*P[n - 2, x] + 6*x*D[P[n - 2, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = (10 + 6*x)*v[i - 2] + 6*x*deriv(v[i - 2], 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

  • Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  • Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
    derived from Ray basis map theorem
  • Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
    derived from Ray basis map theorem

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. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.