A038271 → basis A007318 → x ↦ x/(x+1)

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(1 + x\right)\,P_{n}(x) = \left(12 + 29\,x + 17\,x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1121729
2144408289841
31728734410404491324389
42073611750424969623582483521707281
52488321762560499392070747205011260141985720511149
62985984253808648989056016979328018040536010222970424137569594823321
7358318083553320961510161408356565888050513500804293647568202755579641033867317249876309
Technical details
Node id
n-48ee1acaa798d2f7 · revision 0 · JSON
Definition source
derived:mobius_x_over_x_plus_one
Fingerprint
f6-8b732aeffa021ba5

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:         12,          17;
  2:        144,         408,          289;
  3:       1728,        7344,        10404,          4913;
  4:      20736,      117504,       249696,        235824,         83521;
  5:     248832,     1762560,      4993920,       7074720,       5011260,       1419857;
  6:    2985984,    25380864,     89890560,     169793280,     180405360,     102229704,      24137569;
  7:   35831808,   355332096,   1510161408,    3565658880,    5051350080,    4293647568,    2027555796,     410338673;
  8:  429981696,  4873125888,  24162582528,   68460650496,  121232401920,  137396722176,   97322678208,   39392512608,   6975757441;
  9: 5159780352, 65787199488, 372794130432, 1232291708928, 2618619881472, 3709711498752, 3503616415488, 2127195680832, 753381803628, 118587876497;
%F Formula
The row polynomials satisfy (1+x)*P(n,x) = (12+29*x+17*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[((12 + 29*x + 17*x^2)*P[n - 1, x])/(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] = ((12 + 29*x + 17*x^2)*v[i - 1])/(1 + 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.