A038325 → basis A007318 → basis A007318

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1331144
210897261211936
3359373593711979133185184
411859211581228790614175692146413748096
5391353936522565543483770144945902415765161051164916224
61291467969258293593821524466159566429402391607353188809817715617256313856
74261844297799443033613994430336135524612978518415376595368307531940923059119487171319277809664
Technical details
Node id
n-fea98e97c613f64f · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-f9762973ec1089d7

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:             33,              11;
  2:           1089,             726,             121;
  3:          35937,           35937,           11979,            1331;
  4:        1185921,         1581228,          790614,          175692,          14641;
  5:       39135393,        65225655,        43483770,        14494590,        2415765,         161051;
  6:     1291467969,      2582935938,      2152446615,       956642940,      239160735,       31888098,       1771561;
  7:    42618442977,     99443033613,     99443033613,     55246129785,    18415376595,     3683075319,     409230591,     19487171;
  8:  1406408618241,   3750422981976,   4375493478972,   2916995652648,  1215414855270,   324110628072,   54018438012,   5144613144,   214358881;
  9: 46411484401953, 139234453205859, 185645937607812, 144391284806076, 72195642403038, 24065214134346, 5347825363188, 763975051884, 63664587657, 2357947691;
%F Formula
The row polynomials satisfy P(n,x) = (33+11*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[(33 + 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] = 1; for(n = 1, N, my(i = n + 1); v[i] = (33 + 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

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.