A038259 → basis A007318 → θ+1

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(11 + 5\,n x\right)\,P_{n}(x) = \left(121 + 110\,x + 25\,x^{2} + 55\,n x + 25\,n x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1111021
212122075416
31331363024755007936
4146415324054450220003125147456
5161051732050998250605000171875187502686976
61771561966306016471125133100005671875123750010937548234496
719487171124009270253655325256217500145578125476437508421875625000855638016
Technical details
Node id
n-180bd0fcc1c33878 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-0df1d6c1b80d1c27

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:          1;
  1:         11,          10;
  2:        121,         220,          75;
  3:       1331,        3630,        2475,         500;
  4:      14641,       53240,       54450,       22000,        3125;
  5:     161051,      732050,      998250,      605000,      171875,       18750;
  6:    1771561,     9663060,    16471125,    13310000,     5671875,     1237500,      109375;
  7:   19487171,   124009270,   253655325,   256217500,   145578125,    47643750,     8421875,     625000;
  8:  214358881,  1558973680,  3720278100,  4509428000,  3202718750,  1397550000,   370562500,   55000000,   3515625;
  9: 2357947691, 19292299290, 52615361700, 74405562000, 63413831250, 34589362500, 12228562500, 2722500000, 348046875, 19531250;
%F Formula
The row polynomials satisfy (11+5*n*x)*P(n,x) = (121+(55*n+110)*x+(25*n+25)*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[((121 + (55*n + 110)*x + (25*n + 25)*x^2)*P[n - 1, x])/(11 + 5*n*x)]];
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] = ((121 + (55*n + 110)*x + (25*n + 25)*x^2)*v[i - 1])/(11 + 5*n*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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.