|
Search: id:A103863
|
|
| |
|
| 0, 1, 1, 2, 0, 2, 2, 3, 0, 1, 1, 2, 1, 3, 3, 4, 0, 1, 1, 2, 0, 2, 2, 3, 0, 1, 1, 3, 2, 4, 4, 5, 0, 1, 1, 2, 0, 2, 2, 3, 0, 1, 1, 2, 1, 3, 3, 4, 0, 1, 1, 2, 0, 2, 2, 3, 0, 1, 2, 4, 3, 5, 5, 6, 0, 1, 1, 2, 0, 2, 2, 3, 0, 1, 1, 2, 1, 3, 3, 4, 0, 1, 1, 2, 0, 2, 2, 3, 0, 1, 1, 3, 2, 4, 4, 5, 0, 1, 1, 2, 0, 2, 2, 3, 0
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
a(A104235(n)) = 0.
The Hamming distance between two strings of the same length is the number of places where they differ. - Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 12 2005
|
|
REFERENCES
|
David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers, J. Integer Seq. 8 (2005), no. 3, Article 05.3.6, 15 pp.
F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier/North Holland, 1978, p. 8.
|
|
LINKS
|
David Applegate, Benoit Cloitre, Philippe DELEHAM and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].
Saleem Bhatti, Channel coding; Hamming distance.
Alexander Bogomolny, Distance Between Strings.
National Institute of Standards and Technology, Hamming distance.
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1, s = 0, l = Max[2, Floor[ Log[2, n + 1] + 2]]}, While[ k < l, If[ Mod[n + k, 2^k] == 0, s = s + 2^k]; k++ ]; s]; hammingdistance[n_] := Count[ IntegerDigits[ BitXor[n, f[n] + n], 2], 1]; Table[ hammingdistance[n], {n, 0, 104}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 12 2005)
|
|
CROSSREFS
|
Cf. A103542.
Adjacent sequences: A103860 A103861 A103862 this_sequence A103864 A103865 A103866
Sequence in context: A036461 A063088 A101276 this_sequence A061199 A103615 A070101
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 31 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 12 2005
|
|
|
Search completed in 0.002 seconds
|
