A079510 → basis A007318

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1224
2915630
3441129224272
426590011256101203020
5185479261337411106452472039504
61483376615163275183505114520375485040595336
713349680982420895202970080250924012584963464644032010157440
81334961931291228253106486574205199610535278236148279323526416362880193549968
91468457011591193040465362081970126010613284509104207705171112801874113203929616036288004074148160
101762148411553688103613944724814313919466217985155852264925917116254020398795164642825365645364761662403991680093889358816
11229079293222325993328985644108122601326591284559215771325570342877124839697394282989222731121285790213283666786883262365420804790016002351124167424
12320711010493425069596521671586013383492895567650297781667270431374624731480014038794987217104922698317585693863570252218737507216856446642137687820986240622702080063570351682240
13481066515734558872785745429889767280450974293426375502159244729572703435231786936184035646486081983543953956412102325908857503001126507974561203912644266238492260413181441323378120960871782912001845801323790592
14769706425174596665586508335562388821664085200879477411827549209140699754758744580985390965116230930440574951173736663602574590475862219028005296843827732600231793622418072073507157082216015965201169216021251751494400130767436800057281150264184960
Technical details
Node id
n-4770949c8ef98ba1 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-6ce805bb80e27667

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:        2,         2;
  2:        9,        15,         6;
  3:       44,       112,        92,        24;
  4:      265,       900,      1125,       610,        120;
  5:     1854,      7926,     13374,     11106,       4524,       720;
  6:    14833,     76615,    163275,    183505,     114520,     37548,      5040;
  7:   133496,    809824,   2089520,   2970080,    2509240,   1258496,    346464,     40320;
  8:  1334961,   9312912,  28253106,  48657420,   51996105,  35278236,  14827932,   3526416,   362880;
  9: 14684570, 115911930, 404653620, 819701260, 1061328450, 910420770, 517111280, 187411320, 39296160, 3628800;
%F Formula
The row polynomials satisfy P(n,x) = (n+1+(n+1)*x)*P(n-2,x) + (n+1+(n+1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 2*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[(n + 1 + (n + 1)*x)*P[n - 2, x] + (n + 1 + (n + 1)*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] = 2 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (n + 1 + (n + 1)*x)*v[i - 2] + (n + 1 + (n + 1)*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