A132440 → D+1 → (1/n)D²+(2/n)D+1/n → x ↦ x/(x+1)

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2347
36181337
46366334139
502410815673361
60060240315136751
70001204505582291357
800002107569033582227
Technical details
Node id
n-67d426944a35ac1a · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-03d79bf818d8c6e6

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: 3,  4;
   3: 6, 18,  13;
   4: 6, 36,  63,  34;
   5: 0, 24, 108, 156,  73;
   6: 0,  0,  60, 240, 315, 136;
   7: 0,  0,   0, 120, 450, 558,  229;
   8: 0,  0,   0,   0, 210, 756,  903,  358;
   9: 0,  0,   0,   0,   0, 336, 1176, 1368,  529;
  10: 0,  0,   0,   0,   0,   0,  504, 1728, 1971, 748;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = -(n-5+(3*n-13)*x+(3*n-10)*x^2+(n-2)*x^3)*P(n-1,x) + (x+3*x^2+3*x^3+x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(n - 5 + (3*n - 13)*x + (3*n - 10)*x^2 + (n - 2)*x^3)*P[n - 1, x] + (x + 3*x^2 + 3*x^3 + x^4)*D[P[n - 1, x], x])/(1 + x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (-(n - 5 + (3*n - 13)*x + (3*n - 10)*x^2 + (n - 2)*x^3)*v[i - 1] + (x + 3*x^2 + 3*x^3 + x^4)*deriv(v[i - 1], x))/(1 + x)); 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. [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.