A249250 → x ↦ x+1 → basis A013609

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
17613
225361273
310321013224469
440910801008384482929
5163953106552379210089618397
66553251643862830048123362496192115417
726215116394213660208776116304365765952384724261
810485752848011289361328352936000401664101760138247684544641
941943123655905763984793267267650243688512127872027033631488153628517293
1016777211046898028652796451551364521782429946240132268803830784693504706563072178943593
116710887459024661394146442475576242847545282220885121194420484414233610949376173107215667261441122856309
1226843545199715976666535968131673388817108706721536430848975195648439541760139229952301486084227072344064122887045830289
131073741838632884303140308296683116267298953284001005840604873645708803923354112151714022441962752080529408101376007495682457644212001917
144294967293710851740146125095243470718403255458728784629550810245225703072032158153728147132157444970677248121834598420975616023949312162201649152277426651897
Technical details
Node id
n-5e6d412cd8e2c69f · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-01f7c797e6d25578

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,       6;
  2:     25,      36,      12;
  3:    103,     210,     132,      24;
  4:    409,    1080,    1008,     384,      48;
  5:   1639,    5310,    6552,    3792,    1008,      96;
  6:   6553,   25164,   38628,   30048,   12336,    2496,     192;
  7:  26215,  116394,  213660,  208776,  116304,   36576,    5952,    384;
  8: 104857,  528480, 1128936, 1328352,  936000,  401664,  101760,  13824,   768;
  9: 419431, 2365590, 5763984, 7932672, 6765024, 3688512, 1278720, 270336, 31488, 1536;
%F Formula
The row polynomials satisfy P(n,x) = (4+4*x)*P(n-2,x) + (3+2*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 6*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 7 + 6*x;
P[n_, x_] := P[n, x] = Expand[(4 + 4*x)*P[n - 2, x] + (3 + 2*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 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (4 + 4*x)*v[i - 2] + (3 + 2*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

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