|
Search: id:A122750
|
|
|
| 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}. |
|
+0
2
|
|
| 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, 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
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
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
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
|
|
FORMULA
|
T(n, k) := If [Mod[n, 2] == 1, (-1)^(k + 1), (-1)^k*(1 + Mod[k, 2])]
|
|
EXAMPLE
|
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
|
|
MATHEMATICA
|
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]
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
|
|
CROSSREFS
|
Cf. A122581, A122582, A122583.
Adjacent sequences: A122747 A122748 A122749 this_sequence A122751 A122752 A122753
Sequence in context: A039738 A075774 A078572 this_sequence A030421 A085021 A060209
|
|
KEYWORD
|
sign,tabl,uned
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 21 2006, Sep 04 2008
|
|
|
Search completed in 0.002 seconds
|
