A225470 → x ↦ x+1 → 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(x + x^{2} + 3\,n + 6\,n x + 3\,n x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1347
218452891
31625857022801729
4194491261602912486364043225
529160167994386451443754254376582401339975
652488035779321014800415330141130100945881464110656049579075
71102248086683932291822588545189049610475076409732812152629968243443202131900225
Technical details
Node id
n-e8222accb67ce557 · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-13e69f2906ee7e95

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,           4;
  2:         18,          45,           28;
  3:        162,         585,          702,          280;
  4:       1944,        9126,        16029,        12486,          3640;
  5:      29160,      167994,       386451,       443754,        254376,         58240;
  6:     524880,     3577932,     10148004,     15330141,      13010094,       5881464,       1106560;
  7:   11022480,    86683932,    291822588,    545189049,     610475076,     409732812,     152629968,     24344320;
  8:  264539520,  2355976368,   9170840412,  20380101876,   28281128049,   25095464388,   13906439532,   4400012880,    608608000;
  9: 7142567040, 71018468496, 313580029428, 807046282188, 1334233309851, 1469449123848, 1078146870228, 508180654656, 139632776640, 17041024000;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = (3*n+(6*n+1)*x+(3*n+1)*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 + 1)*x + (3*n + 1)*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 + 1)*x + (3*n + 1)*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

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. [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.