Real-rooted atlas

A038220 → basis A007318 → θ+1

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(5 + 2\,n x\right)\,P_{n}(x) = \left(25 + 20\,x + 4\,x^{2} + 10\,n x + 4\,n x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1549
225401277
312530018032637
462520001800640805145
5312512500150008000200019240817
6156257500011250080000300005760448319333
7781254375007875007000003500001008001568010242470629

All 15 rows

Technical details
Node id
n-0b5b32088ca1fd1c · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-65a6331fbe5d08da

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:       5,        4;
  2:      25,       40,       12;
  3:     125,      300,      180,       32;
  4:     625,     2000,     1800,      640,       80;
  5:    3125,    12500,    15000,     8000,     2000,      192;
  6:   15625,    75000,   112500,    80000,    30000,     5760,     448;
  7:   78125,   437500,   787500,   700000,   350000,   100800,   15680,   1024;
  8:  390625,  2500000,  5250000,  5600000,  3500000,  1344000,  313600,  40960,   2304;
  9: 1953125, 14062500, 33750000, 42000000, 31500000, 15120000, 4704000, 921600, 103680, 5120;
%F Formula
The row polynomials satisfy (5+2*n*x)*P(n,x) = (25+(10*n+20)*x+(4*n+4)*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[((25 + (10*n + 20)*x + (4*n + 4)*x^2)*P[n - 1, x])/(5 + 2*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] = ((25 + (10*n + 20)*x + (4*n + 4)*x^2)*v[i - 1])/(5 + 2*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.