|
Search: id:A099026
|
|
|
| A099026 |
|
Array x AND NOT y, read by antidiagonals. |
|
+0
2
|
|
| 0, 1, 0, 2, 0, 0, 3, 2, 1, 0, 4, 2, 0, 0, 0, 5, 4, 1, 0, 1, 0, 6, 4, 4, 0, 2, 0, 0, 7, 6, 5, 4, 3, 2, 1, 0, 8, 6, 4, 4, 0, 2, 0, 0, 0, 9, 8, 5, 4, 1, 0, 1, 0, 1, 0, 10, 8, 8, 4, 2, 0, 0, 0, 2, 0, 0, 11, 10, 9, 8, 3, 2, 1, 0, 3, 2, 1, 0, 12, 10, 8, 8, 8, 2, 0, 0, 4, 2, 0, 0, 0, 13, 12, 9, 8, 9, 8, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
For n>0, the n-th row and the differences of the n-th column have period 2^[log2(n)+1].
|
|
FORMULA
|
T(x, y) = x AND NOT y. The AND NOT operation satisfies the bitwise truth table: (0, 0) = 0, (0, 1) = 0, (1, 0) = 1, (1, 1) = 0. $e A099026 0, 0, 0, 0, 0, 0
|
|
EXAMPLE
|
1,0,1,0,1,0,
2,2,0,0,2,2,
3,2,1,0,3,2,
4,4,4,4,0,0,
5,4,5,4,1,0,
|
|
PROGRAM
|
(PARI) T(x, y)=bitnegimply(x, y)
|
|
CROSSREFS
|
Rows include A000004, A059841. Columns include A001477, A052928. Antidiagonal sums are in A099027.
Cf. A003985 (AND), A003986 (OR), A003987 (XOR).
Sequence in context: A077888 A113411 A125095 this_sequence A053202 A050186 A074734
Adjacent sequences: A099023 A099024 A099025 this_sequence A099027 A099028 A099029
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Ralf Stephan, Sep 26 2004
|
|
|
Search completed in 0.002 seconds
|
