A081577 → 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(10 + 8\,x\right)\,P_{n-2}(x) + \left(6 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 6 + 4\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
16410
2465616118
3336608352641360
4247659205152192025615724
51821654192629763558497281024181720
61340564770246935045258242186244710440962100232
7986496408601671324166788608379699212451842211841638424273280
8725953634304768698897928006758456329216248791046725632101580865536280536976
9534221762836188806605701128849100807505244164174192641520435203493068845875202621443242288800
1039312841623165259526071232256931153510492466196486206038016284822732888172134417602969620447232104857637472553568
1128929922561873523558454568149504942878013441073103831048440109465646773305344182488924164908384256866123776901775364194304433086734080
122128923769615029366937648159436953692568461516811879719813121071681437696696374788096328189607936111259942912264429895684179623936394264576167772165005373305024
1315666534873611974152609284186304274432885990837862412657976590336128844705628169607916290048531131216691221753930711046516260208641386804674561984744652817112760326710886457849294263680
141152884469376948440355584035925779740672830142684774401306726897909761481593199656961247225793740807915243254579238035723386880137658378485763691927044096711186186240929793310727381975040268435456668589662127232
Technical details
Node id
n-1fa3228c923a928a · revision 0 · JSON
Definition source
derived:basis_map_A007318
Fingerprint
f6-346585d9f129010f

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:        6,         4;
  2:       46,        56,        16;
  3:      336,       608,       352,        64;
  4:     2476,      5920,      5152,      1920,       256;
  5:    18216,     54192,     62976,     35584,      9728,      1024;
  6:   134056,    477024,    693504,    525824,    218624,     47104,      4096;
  7:   986496,   4086016,   7132416,   6788608,   3796992,   1245184,    221184,    16384;
  8:  7259536,  34304768,  69889792,  80067584,  56329216,  24879104,   6725632,  1015808,   65536;
  9: 53422176, 283618880, 660570112, 884910080, 750524416, 417419264, 152043520, 34930688, 4587520, 262144;
%F Formula
The row polynomials satisfy P(n,x) = (10+8*x)*P(n-2,x) + (6+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 6 + 4*x;
P[n_, x_] := P[n, x] = Expand[(10 + 8*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] = 6 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (10 + 8*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