A013610 → basis A013611 → basis A013609

nonnegative coefficientsonly rational roots

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

Recurrence

\(P_{n}(x) = \left(16 + 24\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1162440
22567685761600
3409618432276481382464000
4655363932168847368847363317762560000
5104857678643202359296035389440265420807962624102400000
616777216150994944566231040113246208012740198407644119041911029764096000000
7268435456281857228812683575296317089382404756340736042807066624214035333124586471424163840000000
Technical details
Node id
n-f5bcaca8318904f4 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-f06e51c139cfae05

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:          16,           24;
  2:         256,          768,           576;
  3:        4096,        18432,         27648,          13824;
  4:       65536,       393216,        884736,         884736,         331776;
  5:     1048576,      7864320,      23592960,       35389440,       26542080,        7962624;
  6:    16777216,    150994944,     566231040,     1132462080,     1274019840,      764411904,      191102976;
  7:   268435456,   2818572288,   12683575296,    31708938240,    47563407360,    42807066624,    21403533312,     4586471424;
  8:  4294967296,  51539607552,  270582939648,   811748818944,  1522029035520,  1826434842624,  1369826131968,   587068342272,   110075314176;
  9: 68719476736, 927712935936, 5566277615616, 19481971654656, 43834436222976, 65751654334464, 65751654334464, 42268920643584, 15850845241344, 2641807540224;
%F Formula
The row polynomials satisfy P(n,x) = (16+24*x)*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[(16 + 24*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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (16 + 24*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. [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.