|
| |
|
|
A101080
|
|
Table of Hamming distances between binary vectors representing i and j, for i >= 0, j >= 0, read by antidiagonals.
|
|
0
| |
|
|
0, 1, 1, 1, 0, 1, 2, 2, 2, 2, 1, 1, 0, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 0, 2, 1, 2, 3, 3, 3, 3, 3, 3, 3, 3, 1, 2, 1, 2, 0, 2, 1, 2, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 2, 1, 1, 0, 1, 1, 2, 1, 2, 3, 3, 3, 3, 2, 2, 2, 2, 3, 3, 3, 3, 2, 2, 1, 2, 2, 1, 0, 1, 2, 2, 1, 2, 2, 3, 3, 2, 2, 3, 3, 1, 1, 3, 3, 2, 2, 3, 3
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,7
|
|
|
COMMENTS
| a[n,0]=a[0,n]=A000120[n]
|
|
|
FORMULA
| a[i, j] = A000120[A003987[i, j]]
|
|
|
EXAMPLE
| a(3,5)=2 because the binary Hamming distance (number of differing bits) between ...0011 and ...0101 is 2.
|
|
|
CROSSREFS
| Cf. A000120, A003987.
Sequence in context: A124752 A174344 A049241 * A130836 A161385 A152907
Adjacent sequences: A101077 A101078 A101079 * A101081 A101082 A101083
|
|
|
KEYWORD
| easy,nonn,tabl
|
|
|
AUTHOR
| Marc LeBrun (mlb(AT)well.com), Nov 29 2004
|
| |
|
|
