A113413 → basis A013611 → basis A007318

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(5 + 4\,x\right)\,P_{n-2}(x) + \left(6 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 7 + 4\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
17411
2475616119
3317572336641289
4213751684608179225613961
51440743684522883084889601024151211
6971273541205321764216321856004300840961637759
7654797278927650457125021888296832010414082007041638417738489
844144172151395245508736545510404051200019079168556236891750465536192124721
9297604871633069483954938885546334724962053122936033281148600322863923241287682621442080893611
1020063500712241110643339790608536456652856165299204003885056196770201665811251214332723218350080104857622538058599
11135261247790827831002756588513649901704512598570060804994226790429570465792124221194243627614208701235200807403524194304244108628489
1291188498976683024385622332184051244985576268860828977024058156717670440304591667220397595033674803249152193829273603368026112352321536167772162643928812281
136147616176748828122813217814125765763952194001280594805352064064117015050245092165607424301643182899213325498449924335271936001009485086721592996659215267266566710886428636265779211
1441445122008735462186347281402553054996833981380489472563379690309126760341807718460541297954816410993168220162125094643302483274901749762434171666432514607546368743733985286576668672268435456310158017102639
Technical details
Node id
n-eedc1a2f77b2e75f · revision 0 · JSON
Definition source
derived:basis_map_A007318
Fingerprint
f6-3f270cf733a15daf

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:        1;
  1:        7,         4;
  2:       47,        56,        16;
  3:      317,       572,       336,        64;
  4:     2137,      5168,      4608,      1792,       256;
  5:    14407,     43684,     52288,     30848,      8960,      1024;
  6:    97127,    354120,    532176,    421632,    185600,     43008,      4096;
  7:   654797,   2789276,   5045712,   5021888,   2968320,   1041408,    200704,    16384;
  8:  4414417,  21513952,  45508736,  54551040,  40512000,  19079168,   5562368,   917504,   65536;
  9: 29760487, 163306948, 395493888, 554633472, 496205312, 293603328, 114860032, 28639232, 4128768, 262144;
%F Formula
The row polynomials satisfy P(n,x) = (5+4*x)*P(n-2,x) + (6+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 7 + 4*x;
P[n_, x_] := P[n, x] = Expand[(5 + 4*x)*P[n - 2, x] + (6 + 4*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] = 7 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (5 + 4*x)*v[i - 2] + (6 + 4*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)

polytool c48629374597

Properties

Proof chains ? JSON

Candidate equalities ?

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