OFFSET
1,2
COMMENTS
The polynomial p(n,x) is defined by recursively by p(n,x)=(nx+n-1)*p(n-1,x) with p[0,x]=1. For an introduction to reductions of polynomials by substitutions such as x^2->x+2, see A192232.
EXAMPLE
MATHEMATICA
q[x_] := x + 1; p[0, x_] := 1;
p[n_, x_] := (n*x + n - 1)*p[n - 1, x] /; n > 0
Table[Simplify[p[n, x]], {n, 1, 5}]
reductionRules = {x^y_?EvenQ -> q[x]^(y/2),
x^y_?OddQ -> x q[x]^((y - 1)/2)};
t = Table[FixedPoint[Expand[#1 /. reductionRules] &, p[n, x]], {n, 1, 30}]
Table[Coefficient[Part[t, n], x, 0], {n, 1, 16}]
(* A192460 *)
Table[Coefficient[Part[t, n], x, 1], {n, 1, 16}]
(* A192461 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Jul 01 2011
STATUS
approved