basis-map coefficients of A030528, shifted → basis A013609 → θ+1

only rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1-1-4-5
2181221
3-1-12-36-32-81
41167212880297
5-1-20-120-320-400-192-1053
6124180640120011524483645
7-1-28-252-1120-2800-4032-3136-1024-12393
81323361792560010752125448192230441553
9-1-36-432-2688-10080-24192-37632-36864-20736-5120-137781
1014054038401680048384940801228801036805120011264452709
11-1-44-660-5280-26400-88704-206976-337920-380160-281600-123904-24576-1476225
1214879270403960015206441395281100811404801126400743424294912532484782969
13-1-52-936-9152-57200-247104-768768-1757184-2965248-3660800-3221504-1916928-692224-114688-15411789
1415610921164880080384384134534435143686918912102502401127526489456644845568160563224576049424013
Technical details
Node id
n-0cb3ed1742a158ee · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-7cabb77b45806852

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): no
  • 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:  1,   8,   12;
  3: -1, -12,  -36,   -32;
  4:  1,  16,   72,   128,     80;
  5: -1, -20, -120,  -320,   -400,   -192;
  6:  1,  24,  180,   640,   1200,   1152,    448;
  7: -1, -28, -252, -1120,  -2800,  -4032,  -3136,  -1024;
  8:  1,  32,  336,  1792,   5600,  10752,  12544,   8192,   2304;
  9: -1, -36, -432, -2688, -10080, -24192, -37632, -36864, -20736, -5120;
%F Formula
The row polynomials satisfy (1+2*n*x)*P(n,x) = -(1+(2*n+4)*x+(4*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[(-(1 + (2*n + 4)*x + (4*n + 4)*x^2)*P[n - 1, x])/(1 + 2*n*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] = (-(1 + (2*n + 4)*x + (4*n + 4)*x^2)*v[i - 1])/(1 + 2*n*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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.