A225473 → θ+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
23811
398096185
427632201615364211
5814640297605529630720120497
624333128383040130560016896007372804148891
7729233840461097625712640582144005750784020643840166924265
821871642712535268164594652161620326400271982592021676032006606028807682995331
Technical details
Node id
n-d457f4ac0217023f · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-084952726d09af56

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,        8;
   3:     9,       80,         96;
   4:    27,      632,       2016,         1536;
   5:    81,     4640,      29760,        55296,        30720;
   6:   243,    33128,     383040,      1305600,      1689600,        737280;
   7:   729,   233840,    4610976,     25712640,     58214400,      57507840,      20643840;
   8:  2187,  1642712,   53526816,    459465216,   1620326400,    2719825920,    2167603200,     660602880;
   9:  6561, 11516480,  608507520,   7748407296,  39975505920,  101443829760,  134680412160,   89841991680,   23781703680;
  10: 19683, 80667848, 6831780480, 125962229760, 914502758400, 3292620226560, 6476798361600, 7094874931200, 4066671329280, 951268147200;
%F Formula
The row polynomials satisfy P(n,x) = (3+8*x)*P(n-1,x) + (4*x+4*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[(3 + 8*x)*P[n - 1, x] + (4*x + 4*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] = (3 + 8*x)*v[i - 1] + (4*x + 4*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. [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.