A249251 → basis A013610

nonnegative coefficients

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

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
14913
2135454121
3432615133241141
4142113433214212194410753
5469464418063344253207611664101341
61549183068877622582831735823328069984955081
751167026340815912987542442393271188016446244199049001093
8168972644381789749683737216114545239753522197497611337408251942484830161
955807980307757482333773841957065221786523852195573041712158567684243215116544799475821
101843183590892311893741589770805263892731182515274182448725419082537281294354080513962496906992647534603033
1160876113026312125629218720565794273005834471716534111332406786517501572476159230746089553655808340122240054419558471009330581
12201060146875348497007576316801789213516890309406569933908837415713713983084010815979777394412859643980869158188800223120189443265173504669222387361
136640564167542245193698297013583552580644505340052184341504675439034598491007211239217138680615451614018988427201011115395072492633052416145300220928195910410246307038808573
14219322935953772707453836000570315961802978738614801123213319748315266041965666900077882641078297619311813134523216896118996867497607774378113024346190020761694036996915211754624614459440238826601

Computed in your browser ?

Technical details
Node id
n-5c48d5a293be0231 · revision 1 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-8bec2d60bfa5bfe4

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

OEIS matches ?

No OEIS matches.

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:     4,      9;
  2:    13,     54,      54;
  3:    43,    261,     513,      324;
  4:   142,   1134,    3321,     4212,     1944;
  5:   469,   4644,   18063,    34425,    32076,     11664;
  6:  1549,  18306,   88776,   225828,   317358,    233280,     69984;
  7:  5116,  70263,  408159,  1298754,  2442393,   2711880,   1644624,    419904;
  8: 16897, 264438, 1789749,  6837372, 16114545,  23975352,  21974976,  11337408,  2519424;
  9: 55807, 980307, 7574823, 33773841, 95706522, 178652385, 219557304, 171215856, 76842432, 15116544;
%F Formula
The row polynomials satisfy P(n,x) = (1+3*x)*P(n-2,x) + (3+6*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 9*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 9*x;
P[n_, x_] := P[n, x] = Expand[(1 + 3*x)*P[n - 2, x] + (3 + 6*x)*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; v[2] = 4 + 9*x; for(n = 2, N, my(i = n + 1); v[i] = (1 + 3*x)*v[i - 2] + (3 + 6*x)*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.

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-c7e040a5542c37c1
  • 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-c7e040a5542c37c1
  • 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-c7e040a5542c37c1
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-c7e040a5542c37c1

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

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