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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1145
22132035
3651138120315
42424690914468403465
5120142265131450215768672045045
672096125187614562922512618223260480675675
7504074484459252153816330321723526884224568060480011486475
Technical details
Node id
n-c29a90ac162bb36b · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-9fa6cce5a014c29e

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:      1,       4;
  2:      2,      13,       20;
  3:      6,      51,      138,       120;
  4:     24,     246,      909,      1446,       840;
  5:    120,    1422,     6513,     14502,     15768,       6720;
  6:    720,    9612,    51876,    145629,    225126,     182232,      60480;
  7:   5040,   74484,   459252,   1538163,   3032172,    3526884,    2245680,    604800;
  8:  40320,  651312,  4493340,  17357076,  41177169,   61568964,   56761164,  29540880,   6652800;
  9: 362880, 6345648, 48255804, 210133764, 578879433, 1048246704, 1249678044, 947001888, 414365760, 79833600;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = (n+(2*n+3)*x+(n+3)*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[((n + (2*n + 3)*x + (n + 3)*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] = ((n + (2*n + 3)*x + (n + 3)*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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.