OFFSET
1,2
COMMENTS
First and last terms of row n: n and 2^(n-1)
Alternating row sums are signed products of two Fibonacci numbers.
For a discussion and guide to related arrays, see A208510.
FORMULA
u(n,x)=x*u(n-1,x)+v(n-1,x)+1,
v(n,x)=u(n-1,x)+2x*v(n-1,x)+1,
where u(1,x)=1, v(1,x)=1.
EXAMPLE
First five rows:
1
2...2
3...5...4
4...10...11...8
5...16...28...23...16
First three polynomials v(n,x): 1, 2 + 2x , 3 + 5x + 4x^2.
MATHEMATICA
u[1, x_] := 1; v[1, x_] := 1; z = 16;
u[n_, x_] := x*u[n - 1, x] + v[n - 1, x] + 1;
v[n_, x_] := u[n - 1, x] + 2 x*v[n - 1, x] + 1;
Table[Expand[u[n, x]], {n, 1, z/2}]
Table[Expand[v[n, x]], {n, 1, z/2}]
cu = Table[CoefficientList[u[n, x], x], {n, 1, z}];
TableForm[cu]
Flatten[%] (* A210211 *)
Table[Expand[v[n, x]], {n, 1, z}]
cv = Table[CoefficientList[v[n, x], x], {n, 1, z}];
TableForm[cv]
Flatten[%] (* A210212 *)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Mar 19 2012
STATUS
approved