A113413 → x ↦ x+1 → basis A013610

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1437
21424947
35013210827317
4178636810432812137
5634285649504104162024314407
6225812276269463045618630583272997127
780425121613613419526416281078732204122187654797
828642209100652770113594412028507921803163866998465614414417
91020108397843011526616507279277946630984360271812247202361961968329760487
103633143329508134867703175999248092130488692443371041815571440460582278732059049200635007
1112939621306406458991238157105008273907170327929472274837374161103168646783381692738025981561771471352612477
1246085145082303625312797075226903214845007702047524804202232910614400957607332704822602092606105666685030565314419118849897
131641346619630466410690276863507374736772943877012073657176137430248941153399305671327649063208329000101977623021682792827634932159432361476161767
1458457426753626004445472209815993129240389362491546795783975687637278834847782326886178710213033743511684135870568023909988584759960630892820884782969414451220087
Technical details
Node id
n-201fbbf05bd763ad · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-b3f6ce63936ad778

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:      4,      3;
  2:     14,     24,       9;
  3:     50,    132,     108,      27;
  4:    178,    636,     810,     432,      81;
  5:    634,   2856,    4950,    4104,    1620,     243;
  6:   2258,  12276,   26946,   30456,   18630,    5832,     729;
  7:   8042,  51216,  136134,  195264,  162810,   78732,   20412,    2187;
  8:  28642, 209100,  652770, 1135944, 1202850,  792180,  316386,   69984,   6561;
  9: 102010, 839784, 3011526, 6165072, 7927794, 6630984, 3602718, 1224720, 236196, 19683;
%F Formula
The row polynomials satisfy P(n,x) = (2+3*x)*P(n-2,x) + (3+3*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 3*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[(2 + 3*x)*P[n - 2, x] + (3 + 3*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 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 3*x)*v[i - 2] + (3 + 3*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