A038207 → basis A008277 → θ+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1325
2914326
32774364141
481350291725799
52431562198082012564736
672967341224375601900198729371
721872839471316616842275038642948190497
Technical details
Node id
n-2cc361eb2d1e8028 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-4dee50b16fc7a87e

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:     1;
  1:     3,      2;
  2:     9,     14,       3;
  3:    27,     74,      36,       4;
  4:    81,    350,     291,      72,       5;
  5:   243,   1562,    1980,     820,     125,      6;
  6:   729,   6734,   12243,    7560,    1900,    198,      7;
  7:  2187,  28394,   71316,   61684,   22750,   3864,    294,     8;
  8:  6561, 117950,  399171,  465192,  236355,  58212,   7154,   416,   9;
  9: 19683, 484922, 2172780, 3323380, 2235975, 749322, 132300, 12336, 567, 10;
%F Formula
The row polynomials satisfy P(n,x) = -(6+4*x+x^2)*P(n-2,x) - (2*x+x^2)*d/dx P(n-2,x) + (5+2*x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(6 + 4*x + x^2)*P[n - 2, x] - (2*x + x^2)*D[P[n - 2, x], x] + (5 + 2*x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
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 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(6 + 4*x + x^2)*v[i - 2] - (2*x + x^2)*deriv(v[i - 2], x) + (5 + 2*x)*v[i - 1] + x*deriv(v[i - 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

Same fingerprint ?

References

  1. [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
  2. [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
  3. [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
  4. [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
  5. [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
  6. [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
  7. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
  8. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.