basis-map coefficients of A297191, shifted → θ+1 → x ↦ x+1

palindromicγ-positivenonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
136312
25203020580
3742105140105427448
49722525046305042527292304
511110495132023102772231013204951101111264
61315685828606435102961201210296643528608581561353248
71521013655460150153003045045514804504530030150155460136521015245760
Technical details
Node id
n-23c8d0096dc333e5 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-2cd9f46ca2d53115

Observed on the stored rows ?

  • Degrees: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28 (affine: slope 2, intercept 0)
  • Palindromic rows: yes
  • γ-positive (gamma_positive): yes
  • 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,   6,    3;
  2:  5,  20,   30,    20,     5;
  3:  7,  42,  105,   140,   105,     42,      7;
  4:  9,  72,  252,   504,   630,    504,    252,     72,      9;
  5: 11, 110,  495,  1320,  2310,   2772,   2310,   1320,    495,    110,     11;
  6: 13, 156,  858,  2860,  6435,  10296,  12012,  10296,   6435,   2860,    858,    156,     13;
  7: 15, 210, 1365,  5460, 15015,  30030,  45045,  51480,  45045,  30030,  15015,   5460,   1365,    210,    15;
  8: 17, 272, 2040,  9520, 30940,  74256, 136136, 194480, 218790, 194480, 136136,  74256,  30940,   9520,  2040,   272,   17;
  9: 19, 342, 2907, 15504, 58140, 162792, 352716, 604656, 831402, 923780, 831402, 604656, 352716, 162792, 58140, 15504, 2907, 342, 19;
%F Formula
The row polynomials satisfy (2*n-1)*P(n,x) = (2*n+1+(4*n+2)*x+(2*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[((2*n + 1 + (4*n + 2)*x + (2*n + 1)*x^2)*P[n - 1, x])/(2*n - 1)]];
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] = ((2*n + 1 + (4*n + 2)*x + (2*n + 1)*x^2)*v[i - 1])/(2*n - 1)); 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.