A122542 → D+1 → θ+1

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(x^{3}\right)\,P_{n-6}(x) + \left(3\,x^{2} + 3\,x^{3}\right)\,P_{n-5}(x) + \left(3\,x + 3\,x^{2} + 3\,x^{3}\right)\,P_{n-4}(x) + \left(1 - 3\,x - 3\,x^{2} + x^{3}\right)\,P_{n-3}(x) + \left(-3 - 3\,x - 3\,x^{2}\right)\,P_{n-2}(x) + \left(3 + 3\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1 + 2\,x\)
\(P_{3}(x) = 2 + 8\,x + 3\,x^{2}\)
\(P_{4}(x) = 2 + 20\,x + 21\,x^{2} + 4\,x^{3}\)
\(P_{5}(x) = 2 + 36\,x + 78\,x^{2} + 40\,x^{3} + 5\,x^{4}\)
\(P_{6}(x) = 2 + 52\,x + 198\,x^{2} + 200\,x^{3} + 65\,x^{4} + 6\,x^{5}\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2123
328313
422021447
523678405161
6252198200656523
72683906644109671637
82846541672169073213384975
Technical details
Node id
n-62c8c2cd2df5630e · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-7b9a7ea9d38360c0

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 -1)
  • 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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1: 1;
   2: 1,   2;
   3: 2,   8,    3;
   4: 2,  20,   21,    4;
   5: 2,  36,   78,   40,     5;
   6: 2,  52,  198,  200,    65,     6;
   7: 2,  68,  390,  664,   410,    96,    7;
   8: 2,  84,  654, 1672,  1690,   732,  133,    8;
   9: 2, 100,  990, 3480,  5210,  3612, 1190,  176,   9;
  10: 2, 116, 1398, 6344, 13050, 13212, 6846, 1808, 225, 10;
%F Formula
The row polynomials satisfy P(n,x) = x^3*P(n-6,x) + (3*x^2+3*x^3)*P(n-5,x) + (3*x+3*x^2+3*x^3)*P(n-4,x) + (1-3*x-3*x^2+x^3)*P(n-3,x) - (3+3*x+3*x^2)*P(n-2,x) + (3+3*x)*P(n-1,x) for n >= 7, with P(1,x) = 1, P(2,x) = 1 + 2*x, P(3,x) = 2 + 8*x + 3*x^2, P(4,x) = 2 + 20*x + 21*x^2 + 4*x^3, P(5,x) = 2 + 36*x + 78*x^2 + 40*x^3 + 5*x^4, P(6,x) = 2 + 52*x + 198*x^2 + 200*x^3 + 65*x^4 + 6*x^5.
%t Mathematica
P[1, x_] := 1;
P[2, x_] := 1 + 2*x;
P[3, x_] := 2 + 8*x + 3*x^2;
P[4, x_] := 2 + 20*x + 21*x^2 + 4*x^3;
P[5, x_] := 2 + 36*x + 78*x^2 + 40*x^3 + 5*x^4;
P[6, x_] := 2 + 52*x + 198*x^2 + 200*x^3 + 65*x^4 + 6*x^5;
P[n_, x_] := P[n, x] = Expand[x^3*P[n - 6, x] + (3*x^2 + 3*x^3)*P[n - 5, x] + (3*x + 3*x^2 + 3*x^3)*P[n - 4, x] + (1 - 3*x - 3*x^2 + x^3)*P[n - 3, x] - (3 + 3*x + 3*x^2)*P[n - 2, x] + (3 + 3*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; v[3] = 2 + 8*x + 3*x^2; v[4] = 2 + 20*x + 21*x^2 + 4*x^3; v[5] = 2 + 36*x + 78*x^2 + 40*x^3 + 5*x^4; v[6] = 2 + 52*x + 198*x^2 + 200*x^3 + 65*x^4 + 6*x^5; for(n = 7, N, my(i = n); v[i] = x^3*v[i - 6] + (3*x^2 + 3*x^3)*v[i - 5] + (3*x + 3*x^2 + 3*x^3)*v[i - 4] + (1 - 3*x - 3*x^2 + x^3)*v[i - 3] - (3 + 3*x + 3*x^2)*v[i - 2] + (3 + 3*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

References

  1. [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
  2. [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
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.