A024462: Triangle T(n,k) read by rows, arising in enumeration of catafusenes.

A024462 ↗ nonnegative coefficientsonly rational roots

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

Recurrence from A024462

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1112
21214
3157316
4182224964
511146908127256
611479228351270811024
7117121465103513238912434096
8120172828243044284860291672916384
9123232134449141171818144174969477218765536
101263012040894626460532987192861965306186561262144
111293792943150665329813267823182227774921651398415196831048576
12132466408023895984962925726298569732151049760747954314928590494194304
1313556254783613517018158806015075722862783396940538972342558790100383317714716777216
141386677164525692785861098603327175273854991255775415805449142504928680203318864653144167108864
Technical details
Node id
n-df53153327eff8f9 · revision 0 · JSON
Definition source
oeis_catalog:A024462
Fingerprint
f6-fedd0649071087c4

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 ?

  • A024462 triangle 66 terms, 11 rows · tabl · nonn · catalog b-file?
  • A323943 reversed triangle 64 terms, 9 rows · tabf · nonn b-file?

Row sums ? A155543, A000302

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 1,  1;
  2: 1,  2,   1;
  3: 1,  5,   7,    3;
  4: 1,  8,  22,   24,    9;
  5: 1, 11,  46,   90,   81,    27;
  6: 1, 14,  79,  228,  351,   270,    81;
  7: 1, 17, 121,  465, 1035,  1323,   891,   243;
  8: 1, 20, 172,  828, 2430,  4428,  4860,  2916,  729;
  9: 1, 23, 232, 1344, 4914, 11718, 18144, 17496, 9477, 2187;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 1 + 2*x + x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[2, x_] := 1 + 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x)*P[n - 1, x])/(n - 2)]];
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] = 1 + x; v[3] = 1 + 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x)*v[i - 1])/(n - 2)); 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

A024462 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  1;
  2: 1,  2,   1;
  3: 1,  5,   7,    3;
  4: 1,  8,  22,   24,    9;
  5: 1, 11,  46,   90,   81,    27;
  6: 1, 14,  79,  228,  351,   270,    81;
  7: 1, 17, 121,  465, 1035,  1323,   891,   243;
  8: 1, 20, 172,  828, 2430,  4428,  4860,  2916,  729;
  9: 1, 23, 232, 1344, 4914, 11718, 18144, 17496, 9477, 2187;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 1 + x, P(2,x) = 1 + 2*x + x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[2, x_] := 1 + 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x)*P[n - 1, x])/(n - 2)]];
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] = 1 + x; v[3] = 1 + 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x)*v[i - 1])/(n - 2)); 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

A323943 reversed triangle, offset 1, from P2
%e Example
Triangle begins:
   1:     1,     2,      1;
   2:     3,     7,      5,      1;
   3:     9,    24,     22,      8,      1;
   4:    27,    81,     90,     46,     11,      1;
   5:    81,   270,    351,    228,     79,     14,     1;
   6:   243,   891,   1323,   1035,    465,    121,    17,     1;
   7:   729,  2916,   4860,   4428,   2430,    828,   172,    20,    1;
   8:  2187,  9477,  17496,  18144,  11718,   4914,  1344,   232,   23,   1;
   9:  6561, 30618,  61965,  71928,  53298,  26460,  8946,  2040,  301,  26,  1;
  10: 19683, 98415, 216513, 277749, 231822, 132678, 53298, 15066, 2943, 379, 29, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where (n-1)*P(n,x) = (n-1+(3*n-3)*x)*P(n-1,x) for n >= 2, with P(1,x) = 1 + 2*x + x^2.
%t Mathematica
P[1, x_] := 1 + 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];
Table[Reverse[CoefficientList[P[n, x], x]], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1 + 2*x + x^2; for(n = 2, N, my(i = n); v[i] = ((n - 1 + (3*n - 3)*x)*v[i - 1])/(n - 1)); v};
row(n, p) = {my(c = Vecrev(p)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

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. [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.