A106246 → D → x ↦ x+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
111
2628
31818339
44072364152
575200180605520
61264506003609061632
71968821575140063012674816
Technical details
Node id
n-ec155d4d9980505c · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-5dbc84ad685f9f2d

Observed on the stored rows ?

  • Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:   0;
  1:   1;
  2:   6,    2;
  3:  18,   18,    3;
  4:  40,   72,   36,     4;
  5:  75,  200,  180,    60,    5;
  6: 126,  450,  600,   360,   90,    6;
  7: 196,  882, 1575,  1400,  630,  126,    7;
  8: 288, 1568, 3528,  4200, 2800, 1008,  168,   8;
  9: 405, 2592, 7056, 10584, 9450, 5040, 1512, 216, 9;
%F Formula
The row polynomials satisfy P(n,x) = -(1+4*x+6*x^2+4*x^3+x^4)*P(n-4,x) + (4+12*x+12*x^2+4*x^3)*P(n-3,x) - (6+12*x+6*x^2)*P(n-2,x) + (4+4*x)*P(n-1,x) for n >= 4, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 6 + 2*x, P(3,x) = 18 + 18*x + 3*x^2.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 6 + 2*x;
P[3, x_] := 18 + 18*x + 3*x^2;
P[n_, x_] := P[n, x] = Expand[-(1 + 4*x + 6*x^2 + 4*x^3 + x^4)*P[n - 4, x] + (4 + 12*x + 12*x^2 + 4*x^3)*P[n - 3, x] - (6 + 12*x + 6*x^2)*P[n - 2, x] + (4 + 4*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; v[3] = 6 + 2*x; v[4] = 18 + 18*x + 3*x^2; for(n = 4, N, my(i = n + 1); v[i] = -(1 + 4*x + 6*x^2 + 4*x^3 + x^4)*v[i - 4] + (4 + 12*x + 12*x^2 + 4*x^3)*v[i - 3] - (6 + 12*x + 6*x^2)*v[i - 2] + (4 + 4*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 - 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.