A038763: Triangular matrix arising in enumeration of catafusenes, read by rows.

A038763 ↗ nonnegative coefficientsonly rational roots

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

Recurrence from A038763

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1112
21438
31715932
4110365427128
51136616218981512
61161053606756482432048
71191536751755267321877298192
8122210113437807938102067290218732768
912527617647182192783402037908240576561131072
1012835125921247440824918541399681377817873219683524288
1113143536452025078246214326415530557685492075255879590492097152
1213452849503118513899644906410585081804275216513017321048266861771478388608
1313763065344603523255186605224057004979799757795582274946022998265720553144133554432
1414074184246563737065615637055003856121968992251735230961359307054802072619985030561594323134217728
Technical details
Node id
n-685ab5842fbad7f4 · revision 1 · JSON
Definition source
oeis_catalog:A038763
Fingerprint
f6-fb13869215ab1dd7

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 ?

  • A038763 triangle 66 terms, 11 rows · tabl · nonn · catalog b-file?
  • A136158 reversed triangle 55 terms, 10 rows · tabl · nonn · catalog b-file?

Row sums ? A004171, A081654, A081294

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 1,  1;
  2: 1,  4,   3;
  3: 1,  7,  15,    9;
  4: 1, 10,  36,   54,   27;
  5: 1, 13,  66,  162,  189,    81;
  6: 1, 16, 105,  360,  675,   648,   243;
  7: 1, 19, 153,  675, 1755,  2673,  2187,   729;
  8: 1, 22, 210, 1134, 3780,  7938, 10206,  7290,  2187;
  9: 1, 25, 276, 1764, 7182, 19278, 34020, 37908, 24057, 6561;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n-1+(3*n-3)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];
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; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (3*n - 3)*x)*v[i - 1])/(n - 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

A038763 triangle, offset 0, from P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  1;
  2: 1,  4,   3;
  3: 1,  7,  15,    9;
  4: 1, 10,  36,   54,   27;
  5: 1, 13,  66,  162,  189,    81;
  6: 1, 16, 105,  360,  675,   648,   243;
  7: 1, 19, 153,  675, 1755,  2673,  2187,   729;
  8: 1, 22, 210, 1134, 3780,  7938, 10206,  7290,  2187;
  9: 1, 25, 276, 1764, 7182, 19278, 34020, 37908, 24057, 6561;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n-1+(3*n-3)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];
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; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (3*n - 3)*x)*v[i - 1])/(n - 1)); 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

A136158 reversed triangle, offset 0, from P0
%e Example
Triangle begins:
  0:    1;
  1:    1,     1;
  2:    3,     4,     1;
  3:    9,    15,     7,     1;
  4:   27,    54,    36,    10,     1;
  5:   81,   189,   162,    66,    13,    1;
  6:  243,   648,   675,   360,   105,   16,    1;
  7:  729,  2187,  2673,  1755,   675,  153,   19,   1;
  8: 2187,  7290, 10206,  7938,  3780, 1134,  210,  22,  1;
  9: 6561, 24057, 37908, 34020, 19278, 7182, 1764, 276, 25, 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(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (3*n - 3)*x)*P[n - 1, x])/(n - 1)]];
Table[Reverse[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; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (3*n - 3)*x)*v[i - 1])/(n - 1)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); 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.