%I A122750
%S A122750 1,1,1,1,2,1,1,1,1,1,1,2,1,2,1,1,1,1,1,1,1,1,2,1,2,1,2,1,1,1,1,1,1,1,1,
%T A122750 1,1,2,1,2,1,2,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1
%V A122750 1,-1,1,1,-2,1,-1,1,-1,1,1,-2,1,-2,1,-1,1,-1,1,-1,1,1,-2,1,-2,1,-2,1,-1,
               1,-1,1,-1,1,-1,
%W A122750 1,1,-2,1,-2,1,-2,1,-2,1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-2,1,-2,1,-2,1,-2,
               1,-2,1
%N A122750 A pattern triangular array with three coefficient states:{-2,-1,1} Rules: 
               States {1,-1} going to States{1,-2,1} States{1,-2} going to {1,-1,
               1} States{-2,1} going to {-1,1,-1}.
%C A122750 The unsigned version is defined by t(n,m)=1 + Mod[n - m, 2]*Mod[m, 2]. 
               - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 06 2008
%C A122750 If the signs are omitted, the row sums are {1, 2, 4, 4, 7, 6, 10, 8, 
               13, 10, 16, ...}. - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), 
               Sep 06 2008
%F A122750 T(n, k) := If [Mod[n, 2] == 1, (-1)^(k + 1), (-1)^k*(1 + Mod[k, 2])]
%e A122750 1
%e A122750 -1, 1
%e A122750 1, -2, 1
%e A122750 -1, 1, -1, 1
%e A122750 1, -2, 1, -2, 1}
%e A122750 -1, 1,-1, 1, -1, 1
%e A122750 1, -2, 1, -2, 1, -2, 1
%t A122750 T[n_, k_] := If [Mod[n, 2] == 1, (-1)^(k + 1), (-1)^k*(1 + Mod[k, 2])] 
               a = Table[Table[T[n, k], {k, 0, n}], {n, 0, 10}]; Flatten[a]
%t A122750 For the unsigned version: t[n_, m_] = 1 + Mod[n - m, 2]*Mod[m, 2]; Table[Table[t[n, 
               m], {m, 0, n}], {n, 0, 10}]; Flatten[%] - Roger L. Bagula (rlbagulatftn(AT)yahoo.com), 
               Sep 06 2008
%Y A122750 Cf. A122581, A122582, A122583.
%Y A122750 Sequence in context: A039738 A075774 A078572 this_sequence A030421 A085021 
               A060209
%Y A122750 Adjacent sequences: A122747 A122748 A122749 this_sequence A122751 A122752 
               A122753
%K A122750 sign,tabl,uned
%O A122750 1,5
%A A122750 Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 21 2006, Sep 04 2008