A225470 → basis A013611 → x ↦ x/(x+1)

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
13710
2187270160
316288215669103520
419441317632904359761456098560
52916023457674390411648169019442766403351040
65248804863888185509443733257641860944248222886086080134041600
7110224801152636485111670241247757696181239422415677916487483648801521520006165913600
Technical details
Node id
n-9f4b706e6d6d188f · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-4cecae6458dfb8cb

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:          1;
  1:          3,           7;
  2:         18,          72,           70;
  3:        162,         882,         1566,           910;
  4:       1944,       13176,        32904,         35976,         14560;
  5:      29160,      234576,       743904,       1164816,        901944,        276640;
  6:     524880,     4863888,     18550944,      37332576,      41860944,      24822288,       6086080;
  7:   11022480,   115263648,    511167024,    1247757696,    1812394224,    1567791648,     748364880,     152152000;
  8:  264539520,  3074956992,  15495390720,   44258861376,   78434676864,   88374037824,   61858923264,   24605864640,   4260256000;
  9: 7142567040, 91224563904, 513699216192, 1675346369472, 3489760977984, 4817574004032, 4409786100672, 2581984966464, 877808715840, 132067936000;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = (3*n+(6*n+4)*x+(3*n+4)*x^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[Together[((3*n + (6*n + 4)*x + (3*n + 4)*x^2)*P[n - 1, x])/(1 + x)]];
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] = ((3*n + (6*n + 4)*x + (3*n + 4)*x^2)*v[i - 1])/(1 + 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

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