A167194 → basis A007318

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1314
24419
3485118
4412136136
541625197172
642041442681144
74246185703491288
84288514615510443101576
9432113231301259147531111152
10436145344532560406200641212304
114401814898761092966606264761314608
124442216701365196820581572870340891419216
1344826589120353333402636302442121042910315118432
144523131156292653687359765660723652163953211816136864
Technical details
Node id
n-ce43d728e75b3d82 · revision 0 · JSON
Definition source
derived:basis_map_A007318
Fingerprint
f6-a681886699e85b8d

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,  1;
  2: 4,  4,   1;
  3: 4,  8,   5,   1;
  4: 4, 12,  13,   6,   1;
  5: 4, 16,  25,  19,   7,   1;
  6: 4, 20,  41,  44,  26,   8,   1;
  7: 4, 24,  61,  85,  70,  34,   9,  1;
  8: 4, 28,  85, 146, 155, 104,  43, 10,  1;
  9: 4, 32, 113, 231, 301, 259, 147, 53, 11, 1;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 3 + x, P(2,x) = 4 + 4*x + x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + x;
P[2, x_] := 4 + 4*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 1, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + x; v[3] = 4 + 4*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 1])/(n - 2)); 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.