A225472 → θ+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2268
344254100
482348106481700
5161218858616848972036388
632618679650288360388800174960937988
76431122692874412776097686009972720367416028267300
812815599458230905371984819867680034537104028291032088179840974837060
Technical details
Node id
n-8256b7d953acaeb6 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-fe60192346c5112b

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:   2,       6;
   3:   4,      42,        54;
   4:   8,     234,       810,        648;
   5:  16,    1218,      8586,      16848,        9720;
   6:  32,    6186,     79650,     288360,      388800,       174960;
   7:  64,   31122,    692874,    4127760,     9768600,      9972720,      3674160;
   8: 128,  155994,   5823090,   53719848,   198676800,    345371040,    282910320,     88179840;
   9: 256,  780738,  47988666,  660795408,  3587272920,   9447490080,  12910998240,   8817984000,   2380855680;
  10: 512, 3905226, 390935970, 7844613480, 60133752000, 225178243920, 456617256480, 512677589760, 299987815680, 71425670400;
%F Formula
The row polynomials satisfy P(n,x) = (2+6*x)*P(n-1,x) + (3*x+3*x^2)*d/dx 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[(2 + 6*x)*P[n - 1, x] + (3*x + 3*x^2)*D[P[n - 1, x], x]];
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] = (2 + 6*x)*v[i - 1] + (3*x + 3*x^2)*deriv(v[i - 1], 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. [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. [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
  5. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.