A144473 A triangle sequence of determinants: a(n)=If[Mod[n, 3] == 0, 1, If[Mod[n, 3] == 1, -1, If[Mod[n, 3] == 2, 0]]]; b(n,m)=If[m < n && Mod[n, 3] == 0, 0, If[m < n && Mod[n, 3] == 1, 0, If[m < n && Mod[n, 3] == 2 && Mod[n, 2] == 0, 1, If[m < n && Mod[n, 3] == 2 && Mod[n, 2] == 1, -1, If[m == n, -1, 0]]]]]; M={{a(m), b(n, m)}, {a(n), b(n, n)}}; t(n,m)=Det[M].

-1, -1, 1, -1, 1, 0, -1, 1, 0, -1, -1, 1, 0, -1, 1, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, -1, 1, 0, -1, 1, 0, -1, 1, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1, 1, 0, -1

Offset

1,1

Comments

Row sums are:{-1, 0, 0, -1, 0, 0, -1, 0, 0, -1}.

Links

Table of n, a(n) for n=1..55.

Formula

a(n)=If[Mod[n, 3] == 0, 1, If[Mod[n, 3] == 1, -1, If[Mod[n, 3] == 2, 0]]]; b(n,m)=If[m < n && Mod[n, 3] == 0, 0, If[m < n && Mod[n, 3] == 1, 0, If[m < n && Mod[n, 3] == 2 && Mod[n, 2] == 0, 1, If[m < n && Mod[n, 3] == 2 && Mod[n, 2] == 1, -1, If[m == n, -1, 0]]]]]; M={{a(m), b(n, m)}, {a(n), b(n, n)}}; t(n,m)=Det[M].

Example

{-1},
{-1, 1},
{-1, 1, 0},
{-1, 1, 0, -1},
{-1, 1, 0, -1, 1},
{-1, 1, 0, -1, 1, 0},
{-1, 1, 0, -1, 1, 0, -1},
{-1, 1, 0, -1, 1, 0, -1, 1},
{-1, 1, 0, -1, 1, 0, -1, 1, 0},
{-1, 1, 0, -1, 1, 0, -1, 1, 0, -1}

Mathematica

Clear[a, b, t, n, m] a[n_] := If[Mod[n, 3] == 0, 1, If[Mod[n, 3] == 1, -1, If[Mod[n, 3] == 2, 0]]]; b[n, m_] := If[m < n && Mod[n, 3] == 0, 0, If[m < n && Mod[n, 3] == 1, 0, If[m < n && Mod[n, 3] == 2 && Mod[n, 2] == 0, 1, If[m < n && Mod[n, 3] == 2 && Mod[n, 2] == 1, -1, If[m == n, -1, 0]]]]]; M := {{a[m], b[n, m]}, {a[n], b[n, n]}}; t[n_, m_] := Det[M]; Table[Table[t[n, m], {m, 0, n - 1}], {n, 1, 10}]; Flatten[%]

Crossrefs

Sequence in context: A071038 A131522 A221641 * A011750 A340375 A010055

Adjacent sequences: A144470 A144471 A144472 * A144474 A144475 A144476

Keyword

sign,uned

Author

Roger L. Bagula and Gary W. Adamson, Oct 10 2008

Status

approved