A038281 → x ↦ x+1 → reverse

nonnegative coefficientsonly rational roots

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

Recurrence

\(P_{n}(x) = \left(3 + 11\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 9 + 66\,x + 121\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
0966121196
127297108913312744
28111886534159721464138416
3243445532670119790219615161051537824
4729160381470157187401976535289891817715617529536
5218756133617463377338513835745304386393720278119487171105413504
66561192456246985218112248830144702435091124464333724676921042143588811475789056
7196836495399526572815051164482781381643686506401790034863138434045787689787235794769120661046784
Technical details
Node id
n-830d062cddf4b58c · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-4f0d71d8efeb5cf0

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • 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:      9,      66,       121;
  1:     27,     297,      1089,       1331;
  2:     81,    1188,      6534,      15972,       14641;
  3:    243,    4455,     32670,     119790,      219615,      161051;
  4:    729,   16038,    147015,     718740,     1976535,     2898918,      1771561;
  5:   2187,   56133,    617463,    3773385,    13835745,    30438639,     37202781,     19487171;
  6:   6561,  192456,   2469852,   18112248,    83014470,   243509112,    446433372,    467692104,    214358881;
  7:  19683,  649539,   9526572,   81505116,   448278138,  1643686506,   4017900348,   6313843404,   5787689787,    2357947691;
  8:  59049, 2165130,  35724645,  349307640,  2241390690,  9862119036,  30134252610,  63138434040,  86815346805,   70738430730,  25937424601;
  9: 177147, 7144929, 130990365, 1440894015, 10566556110, 54241654698, 198886067226, 520892080830, 954968814855, 1167184107045, 855935011833, 285311670611;
%F Formula
The row polynomials satisfy P(n,x) = (3+11*x)*P(n-1,x) for n >= 1, with P(0,x) = 9 + 66*x + 121*x^2.
%t Mathematica
P[0, x_] := 9 + 66*x + 121*x^2;
P[n_, x_] := P[n, x] = Expand[(3 + 11*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] = 9 + 66*x + 121*x^2; for(n = 1, N, my(i = n + 1); v[i] = (3 + 11*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

Candidate equalities ?

Same fingerprint ?

References

  1. [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
  2. [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
  3. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.