1,3

Row sums are (2^n times) :

{1, -1, -3, 7, 5, -33, 13, 119, -171, -305, 989};

This type of matrix was suggested to me by the Cartan matrix type

with the factor (2-x) in the recursion with has rational opposite (1-2*x).

Matrix: M(n,m,d)=If[ n == m, 1/2, If[n == d && m ==d - 1, -1, If[(n == m - 1 || n == m + 1), -1, 0]]]; out_n,m=Coefficient(2^n*CharacteristicPolynomial[M(n,m,d)); Polynomial recursion: p(x, n) = (1 - 2*x)*p(x, n - 1)/2 - p(x, n - 2); out_n,m=Coefficient(2^n*p(x,n)).

{1},

{1, -2},

{-3, -4, 4},

{-7, 10, 12, -8},

{5, 40, -24, -32, 16},

{33, -10, -152, 48, 80, -32},

{13, -236, -36, 480, -80, -192, 64},

{-119, -222, 1044, 360, -1360, 96, 448, -128},

{-171, 960, 1632, -3648, -1760, 3584, 0, -1024, 256},

{305, 2190, -4464, -8352, 10976, 6720, -8960, -512, 2304, -512},

{989, -2260, -15372, 15168, 34720, -29568, -22400, 21504, 2304, -5120, 1024}

(* Matrix Mathematica*) T[n_, m_, d_] := If[ n == m, 1/2, If[n == d && m == d - 1, -1, If[(n == m - 1 || n == m + 1), -1, 0]]]; M[d_] := Table[T[n, m, d], {n, 1, d}, {m, 1, d}]; a1 = Table[M[d], {d, 1, 10}]; Table[2^d*Det[M[d]], {d, 1, 10}]; g = Table[Det[M[d] - x*IdentityMatrix[d]], {d, 1, 10}]; a = Join[{{1}}, Table[2^d*CoefficientList[Det[M[d] - x*IdentityMatrix[d]], x], {d, 1, 10}]]; Flatten[a] (* Polynomial recursion*) Clear[p] p[x, 0] = 1; p[x, 1] = (1 - 2*x)/2; p[x, 2] = (-3 - 4 x + 4*x^2)/4; p[x_, n_] := p[x, n] = (1 - 2*x)*p[x, n - 1]/2 - p[x, n - 2]; Table[ExpandAll[2^n*p[x, n]], {n, 0, Length[g] - 1}]; Flatten[Table[CoefficientList[2^n*p[x, n], x], {n, 0, Length[g] - 1}]]

Adjacent sequences: A136327 A136328 A136329 this_sequence A136331 A136332 A136333

Sequence in context: A049988 A079247 A006087 this_sequence A028298 A047966 A097093

tabl,uned,sign

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Apr 12 2008