Real-rooted atlas

A272866: Triangle read by rows, T(n,k) = GegenbauerC(m,-n,-3/2) where m = k if k<n else 2*n-k, for n>=0 and 0<=k<=2n.

A272866 palindromic γ-positive nonnegative coefficients

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

Recurrence from OEIS A272866
\(P_{n}(x) = \left(1 + 3\,x + x^{2}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
11315
216116125
31930453091125
41125814419514458121625
511595330685873685330951513125
61181416301770325839893258177063014118115625
712119610713801919815533184831553391983801107119621178125

Show all 15 stored rows

Generated b-files: A000351 (row sums), A272866, A272866 (reversed triangle) ?

Computed in your browser ?

Technical details
Node id
n-b30e7a5b4198051a · revision 2 · JSON
Definition source
oeis_catalog:A272866
Fingerprint
f6-30532c6d7b66f9d6

Observed on the stored rows ?

  • Degrees: 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28 (affine: slope 2, 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,  3,   1;
  2: 1,  6,  11,    6,     1;
  3: 1,  9,  30,   45,    30,     9,      1;
  4: 1, 12,  58,  144,   195,   144,     58,     12,      1;
  5: 1, 15,  95,  330,   685,   873,    685,    330,     95,     15,      1;
  6: 1, 18, 141,  630,  1770,  3258,   3989,   3258,   1770,    630,    141,     18,      1;
  7: 1, 21, 196, 1071,  3801,  9198,  15533,  18483,  15533,   9198,   3801,   1071,    196,    21,     1;
  8: 1, 24, 260, 1680,  7210, 21672,  46928,  74280,  86515,  74280,  46928,  21672,   7210,  1680,   260,   24,   1;
  9: 1, 27, 333, 2484, 12510, 44982, 119154, 236736, 356283, 408105, 356283, 236736, 119154, 44982, 12510, 2484, 333, 27, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+3*x+x^2)*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 + 3*x + x^2)*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] = (1 + 3*x + x^2)*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)

Generated with polytool c48629374597.

A272866: triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  3,   1;
  2: 1,  6,  11,    6,     1;
  3: 1,  9,  30,   45,    30,     9,      1;
  4: 1, 12,  58,  144,   195,   144,     58,     12,      1;
  5: 1, 15,  95,  330,   685,   873,    685,    330,     95,     15,      1;
  6: 1, 18, 141,  630,  1770,  3258,   3989,   3258,   1770,    630,    141,     18,      1;
  7: 1, 21, 196, 1071,  3801,  9198,  15533,  18483,  15533,   9198,   3801,   1071,    196,    21,     1;
  8: 1, 24, 260, 1680,  7210, 21672,  46928,  74280,  86515,  74280,  46928,  21672,   7210,  1680,   260,   24,   1;
  9: 1, 27, 333, 2484, 12510, 44982, 119154, 236736, 356283, 408105, 356283, 236736, 119154, 44982, 12510, 2484, 333, 27, 1;
%F Formula
The row polynomials satisfy P(n,x) = (1+3*x+x^2)*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 + 3*x + x^2)*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] = (1 + 3*x + x^2)*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)

Generated with polytool c48629374597.

A272866: reversed triangle, offset 0, from the row P0
%e Example
Triangle begins:
  0: 1;
  1: 1,  3,   1;
  2: 1,  6,  11,    6,     1;
  3: 1,  9,  30,   45,    30,     9,      1;
  4: 1, 12,  58,  144,   195,   144,     58,     12,      1;
  5: 1, 15,  95,  330,   685,   873,    685,    330,     95,     15,      1;
  6: 1, 18, 141,  630,  1770,  3258,   3989,   3258,   1770,    630,    141,     18,      1;
  7: 1, 21, 196, 1071,  3801,  9198,  15533,  18483,  15533,   9198,   3801,   1071,    196,    21,     1;
  8: 1, 24, 260, 1680,  7210, 21672,  46928,  74280,  86515,  74280,  46928,  21672,   7210,  1680,   260,   24,   1;
  9: 1, 27, 333, 2484, 12510, 44982, 119154, 236736, 356283, 408105, 356283, 236736, 119154, 44982, 12510, 2484, 333, 27, 1;
%F Formula
Row n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+3*x+x^2)*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 + 3*x + x^2)*P[n - 1, x]];
Table[Reverse[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 + 3*x + x^2)*v[i - 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 - 1, v[i])))};
T(9)

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-0e058c428dfdfeb6, e-d82c9b48e4b31a6b
  • 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-0e058c428dfdfeb6, e-d82c9b48e4b31a6b
  • 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-0e058c428dfdfeb6, e-d82c9b48e4b31a6b

Proof chains

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

Used in 15 proof steps

No candidate equalities or related sequences.