A019538 → x ↦ x+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2325
31318637
47515810824365
5541153015907201204501
64683166222322015960540072066605
7472932019783546063276001680004536050401149877
8545835272487857629886693624461160018849604233604032022687565
970872614049289010020327014026824012149172066679200226497604354560362880503589781
101022475636579449421864917540305596572031905090002200973040100336320029151360048988800362880012420052205
11162263257311611834938370938870066965533080085147194000708009271204055862888015807052800401163840059875200039916800336947795317
122809156759522129182279878661247266816654170696242333493835200227200339872015686364355207680245126402613552480005887728000079035264004790016009972186170765
1352685834838145303839626501773589014015041799405407760660495268633207372066141440059597732113920351633637555201502860334976045379414080009190044864001120863744006227020800319727684645461
14106413429704439917958103326242401059559586011009326403602801936946544132600243844185200616022598840968704001561160240640000803925509587200304804365465600827104037760001521261181440016999766784008717829120011039636939221805
152302831909778532312402554523898107192299456242063040280641976760058943279883852000826322417633512808638290236728152068409726703718400412429095029952001883759413536000064169688046464001580978310912000266329679616000274611617280001307674368000408406422098722357
Technical details
Node id
n-9cb46fc45f534e25 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-d4e4e266d9f48188

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 -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:         1;
   2:         3,         2;
   3:        13,        18,          6;
   4:        75,       158,        108,         24;
   5:       541,      1530,       1590,        720,        120;
   6:      4683,     16622,      23220,      15960,       5400,        720;
   7:     47293,    201978,     354606,     327600,     168000,      45360,       5040;
   8:    545835,   2724878,    5762988,    6693624,    4611600,    1884960,     423360,     40320;
   9:   7087261,  40492890,  100203270,  140268240,  121491720,   66679200,   22649760,   4354560,   362880;
  10: 102247563, 657944942, 1864917540, 3055965720, 3190509000, 2200973040, 1003363200, 291513600, 48988800, 3628800;
%F Formula
The row polynomials satisfy P(n,x) = (3+2*x)*P(n-1,x) + (2+3*x+x^2)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3 + 2*x)*P[n - 1, x] + (2 + 3*x + x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (3 + 2*x)*v[i - 1] + (2 + 3*x + x^2)*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

References

  1. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741