A143491 → basis A013610 → 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 + 4\,x + n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 9 + 21\,x + 12\,x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
09211242
12710814160336
281486107110263603024
324320256615105758262252030240
4729801936045846451093867365620160332640
5218730618180306578340108996312054427233841814403991680
665611137248470983538080905328914515956142245727778160181440051891840
719683413343379225819932318660787471431340472023492321798047729100296019958400726485760
Technical details
Node id
n-c19fadb819dc3b47 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-d86661683c23bbdc

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,      21,       12;
  1:     27,     108,      141,        60;
  2:     81,     486,     1071,      1026,        360;
  3:    243,    2025,     6615,     10575,       8262,       2520;
  4:    729,    8019,    36045,     84645,     109386,      73656,       20160;
  5:   2187,   30618,   180306,    578340,    1089963,    1205442,      723384,      181440;
  6:   6561,  113724,   847098,   3538080,    9053289,   14515956,    14224572,     7778160,     1814400;
  7:  19683,  413343,  3792258,  19932318,   66078747,  143134047,   202349232,   179804772,    91002960,    19958400;
  8:  59049, 1476225, 16336890, 105304050,  437424057, 1222347105,  2324656260,  2967605100,  2430666144,  1151910720,   239500800;
  9: 177147, 5196312, 68201595, 528291720, 2681224821, 9353554056, 22864481145, 39123346680, 45870864732, 35054392032, 15693341760, 3113510400;
%F Formula
The row polynomials satisfy P(n,x) = (3+(n+4)*x)*P(n-1,x) for n >= 1, with P(0,x) = 9 + 21*x + 12*x^2.
%t Mathematica
P[0, x_] := 9 + 21*x + 12*x^2;
P[n_, x_] := P[n, x] = Expand[(3 + (n + 4)*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 + 21*x + 12*x^2; for(n = 1, N, my(i = n + 1); v[i] = (3 + (n + 4)*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. [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.