|
Search: id:A140085
|
|
|
| A140085 |
|
Period 8: repeat 0,1,1,2,1,2,2,3. |
|
+0
2
|
|
| 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1, 2, 1, 2, 2, 3, 0, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Also fix e = 8; then a(n) = minimal Hamming distance between the binary representation of n and the binary representation of any multiple ke (0 <= k <= n/e) which is a child of n.
A number m is a child of n if the binary representation of n has a 1 in every position where the binary representation of m has a 1.
|
|
FORMULA
|
a(n)=(1/56)*{24*(n mod 8)-4*[(n+1) mod 8]+3*[(n+2) mod 8]-4*[(n+3) mod 8]+10*[(n+4) mod 8]-4*[(n+5) mod 8]+3*[(n+6) mod 8]-4*[(n+7) mod 8]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jun 06 2008
|
|
PROGRAM
|
See link in A140080 for Fortran program.
|
|
CROSSREFS
|
Sequence in context: A071227 A108115 A089254 this_sequence A071445 A144081 A140086
Adjacent sequences: A140082 A140083 A140084 this_sequence A140086 A140087 A140088
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Nadia Heninger (nadiah(AT)cs.princeton.edu) and njas, Jun 03 2008
|
|
|
Search completed in 0.002 seconds
|
