A202241: Array F(n,m) read by antidiagonals: F(0,m)=1, F(n,0) = A130713(n), and column m+1 is recursively defined as the partial sums of column m.

A202241 ↗ nonnegative coefficients

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

Recurrence from A202241

\(\left(-3 + n\right)\,P_{n}(x) = \left(-3 - 3\,x + n + n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + x\)
\(P_{2}(x) = 1 + 3\,x + x^{2}\)
\(P_{3}(x) = 4\,x + 4\,x^{2} + x^{3}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1213
21315
304419
40485118
50412136136
6041625197172
7042041442681144
804246185703491288
904288514615510443101576
100432113231301259147531111152
110436145344532560406200641212304
1204401814898761092966606264761314608
1304442216701365196820581572870340891419216
14044826589120353333402636302442121042910315118432
Technical details
Node id
n-ab5ae7f91c188f17 · revision 0 · JSON
Definition source
oeis_catalog:A202241
Fingerprint
f6-772dd6d8aefc1782

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 ℚ): no

Matches ?

  • A202241 triangle 78 terms, 12 rows · tabl · nonn · catalog b-file?
  • A391533 triangle 63 terms, 9 rows · tabf · nonn · catalog b-file?

Row sums ? A005010, A116453, A288135

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 2, 1;
  2: 1, 3,  1;
  3: 0, 4,  4,  1;
  4: 0, 4,  8,  5,   1;
  5: 0, 4, 12, 13,   6,   1;
  6: 0, 4, 16, 25,  19,   7,   1;
  7: 0, 4, 20, 41,  44,  26,   8,  1;
  8: 0, 4, 24, 61,  85,  70,  34,  9,  1;
  9: 0, 4, 28, 85, 146, 155, 104, 43, 10, 1;
%F Formula
The row polynomials satisfy (n-3)*P(n,x) = (n-3+(n-3)*x)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2 + x, P(2,x) = 1 + 3*x + x^2, P(3,x) = 4*x + 4*x^2 + x^3.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + x;
P[2, x_] := 1 + 3*x + x^2;
P[3, x_] := 4*x + 4*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[Together[((n - 3 + (n - 3)*x)*P[n - 1, x])/(n - 3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + x; v[3] = 1 + 3*x + x^2; v[4] = 4*x + 4*x^2 + x^3; for(n = 4, N, my(i = n + 1); v[i] = ((n - 3 + (n - 3)*x)*v[i - 1])/(n - 3)); 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

A202241 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 2, 1;
  2: 1, 3,  1;
  3: 0, 4,  4,  1;
  4: 0, 4,  8,  5,   1;
  5: 0, 4, 12, 13,   6,   1;
  6: 0, 4, 16, 25,  19,   7,   1;
  7: 0, 4, 20, 41,  44,  26,   8,  1;
  8: 0, 4, 24, 61,  85,  70,  34,  9,  1;
  9: 0, 4, 28, 85, 146, 155, 104, 43, 10, 1;
%F Formula
The row polynomials satisfy (n-3)*P(n,x) = (n-3+(n-3)*x)*P(n-1,x) for n >= 4, with P(0,x) = 1, P(1,x) = 2 + x, P(2,x) = 1 + 3*x + x^2, P(3,x) = 4*x + 4*x^2 + x^3.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + x;
P[2, x_] := 1 + 3*x + x^2;
P[3, x_] := 4*x + 4*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[Together[((n - 3 + (n - 3)*x)*P[n - 1, x])/(n - 3)]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + x; v[3] = 1 + 3*x + x^2; v[4] = 4*x + 4*x^2 + x^3; for(n = 4, N, my(i = n + 1); v[i] = ((n - 3 + (n - 3)*x)*v[i - 1])/(n - 3)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)

polytool c48629374597

A391533 triangle, offset 2, from P3, low zeros dropped
%e Example
Triangle begins:
   2: 4,  4,   1;
   3: 4,  8,   5,   1;
   4: 4, 12,  13,   6,   1;
   5: 4, 16,  25,  19,   7,    1;
   6: 4, 20,  41,  44,  26,    8,   1;
   7: 4, 24,  61,  85,  70,   34,   9,   1;
   8: 4, 28,  85, 146, 155,  104,  43,  10,   1;
   9: 4, 32, 113, 231, 301,  259, 147,  53,  11,  1;
  10: 4, 36, 145, 344, 532,  560, 406, 200,  64, 12,  1;
  11: 4, 40, 181, 489, 876, 1092, 966, 606, 264, 76, 13, 1;
%F Formula
Row n lists the coefficients of P(n,x) in ascending powers of x, starting at the lowest nonzero coefficient, where (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-1,x) for n >= 3, with P(2,x) = 4*x + 4*x^2 + x^3.
%t Mathematica
P[2, x_] := 4*x + 4*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 1, x])/(n - 2)]];
Table[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], {n, 2, 11}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N - 1)); v[1] = 4*x + 4*x^2 + x^3; for(n = 3, N, my(i = n - 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 1])/(n - 2)); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i + 1, v[i])))};
T(11)

polytool c48629374597

Properties

Proof chains ? JSON

Used in 5

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