A167884: Triangle read by rows: T(n,k) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m*n-m*k+1)*T(n-1,k-1) + (m*k-m+1)*T(n-1,k), where m = 8.

A167884 palindromic γ-positive nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0) · coefficients of one sign · interlacing (weak) · Hadamard kernel what this means

Recurrence from OEIS A167884
\(P_{n}(x) = \left(1 - 7\,x + 8\,n x\right)\,P_{n-1}(x) + \left(8\,x - 8\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1112
2118120
311791791360
4116366086163619360
5114757144362144362147571318240
61132854294113572181002941135132854113366080
711195735554463092775099552775099555544630911957351668304000
811076167210011782689211047544183156570309211047544100117826810761672138761632000
919685511317633445860279333923732982069631294982069631294279333923732176334458609685511312558267712000
101871696090306064161965798845450732046095660095570805297097661084609566009557079884545073203060641619658716960901189311810688000
11178452648915266724567975219605533210725197649869007105055604054450933585560405445093358197649869007105021960553321072552667245679757845264891115523568476416000
1217060738410890169784111746587460922373030079498816431041775340637048582877528544919733619149084340637048582877528794988164310417755874609223730300901697841117467060738410811397121162877440000
1316354664570691539170387085294154168983106308926305230741555669047519133542059915694023461173787165623242124611737871656232421219133542059915694023305230741555669047515416898310630892615391703870852946354664570691136917873961989120000
1415719198113726262275368267856913991210742108314316113213832344981808681100729366579218185961835034317910060739978835257381173688104960168350343179100607399788310072936657921818596181132138323449818086813991210742108314316262275368267856915719198113726114513294639970846720000

Generated b-files: A084948 (row sums), A167884, A167884 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-90af30f849fc554d · revision 1 · JSON
Definition source
oeis_catalog:A167884
Fingerprint
f6-096b716e28fb0b30

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: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

OEIS matches ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0: 1;
  1: 1,        1;
  2: 1,       18,           1;
  3: 1,      179,         179,            1;
  4: 1,     1636,        6086,         1636,            1;
  5: 1,    14757,      144362,       144362,        14757,            1;
  6: 1,   132854,     2941135,      7218100,      2941135,       132854,            1;
  7: 1,  1195735,    55446309,    277509955,    277509955,     55446309,      1195735,           1;
  8: 1, 10761672,  1001178268,   9211047544,  18315657030,   9211047544,   1001178268,    10761672,        1;
  9: 1, 96855113, 17633445860, 279333923732, 982069631294, 982069631294, 279333923732, 17633445860, 96855113, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(8*n-7)*x)*P(n-1,x) + (8*x-8*x^2)*d/dx 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[(1 + (8*n - 7)*x)*P[n - 1, x] + (8*x - 8*x^2)*D[P[n - 1, x], 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] = (1 + (8*n - 7)*x)*v[i - 1] + (8*x - 8*x^2)*deriv(v[i - 1], x)); 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)

Generated with polytool c48629374597.

A167884: triangle, offset 1, from the row P0
%e Example
Triangle begins:
   1: 1;
   2: 1,        1;
   3: 1,       18,           1;
   4: 1,      179,         179,            1;
   5: 1,     1636,        6086,         1636,            1;
   6: 1,    14757,      144362,       144362,        14757,            1;
   7: 1,   132854,     2941135,      7218100,      2941135,       132854,            1;
   8: 1,  1195735,    55446309,    277509955,    277509955,     55446309,      1195735,           1;
   9: 1, 10761672,  1001178268,   9211047544,  18315657030,   9211047544,   1001178268,    10761672,        1;
  10: 1, 96855113, 17633445860, 279333923732, 982069631294, 982069631294, 279333923732, 17633445860, 96855113, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+(8*n-15)*x)*P(n-1,x) + (8*x-8*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (8*n - 15)*x)*P[n - 1, x] + (8*x - 8*x^2)*D[P[n - 1, x], x]];
Table[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (8*n - 15)*x)*v[i - 1] + (8*x - 8*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

A167884: reversed triangle, offset 1, from the row P0
%e Example
Triangle begins:
   1: 1;
   2: 1,        1;
   3: 1,       18,           1;
   4: 1,      179,         179,            1;
   5: 1,     1636,        6086,         1636,            1;
   6: 1,    14757,      144362,       144362,        14757,            1;
   7: 1,   132854,     2941135,      7218100,      2941135,       132854,            1;
   8: 1,  1195735,    55446309,    277509955,    277509955,     55446309,      1195735,           1;
   9: 1, 10761672,  1001178268,   9211047544,  18315657030,   9211047544,   1001178268,    10761672,        1;
  10: 1, 96855113, 17633445860, 279333923732, 982069631294, 982069631294, 279333923732, 17633445860, 96855113, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+(8*n-15)*x)*P(n-1,x) + (8*x-8*x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (8*n - 15)*x)*P[n - 1, x] + (8*x - 8*x^2)*D[P[n - 1, x], x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n]], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + (8*n - 15)*x)*v[i - 1] + (8*x - 8*x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0)
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-46d699555fa04487
  • Coefficients of one sign. Every nonzero row, n >= 0: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-46d699555fa04487
  • Hadamard kernel (Malo). Rows P_n, n >= 0, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-46d699555fa04487
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-46d699555fa04487

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

Used in 3 proof steps

No candidate equalities or related sequences.

References

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