login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182336 a(n) is the least m>=n, such that the Hamming distance D(n,m)=4. 3
15, 14, 13, 12, 11, 10, 9, 8, 19, 18, 17, 16, 17, 16, 16, 17, 31, 30, 29, 28, 27, 26, 25, 24, 33, 32, 32, 33, 32, 33, 34, 35, 47, 46, 45, 44, 43, 42, 41, 40, 51, 50, 49, 48, 49, 48, 48, 49, 63, 62, 61, 60, 59, 58, 57, 56, 64, 65, 66, 67, 68, 69, 70, 71, 79, 78, 77, 76, 75, 74 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Or (see comment in A206853) a(n)=n<+>4.
Conjecture: for n > 96, n + 1 <= a(n) <= 9n/8 + 1. - Charles R Greathouse IV, Apr 25 2012
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 0..10000
PROG
(PARI) hamming(n)=my(v=binary(n)); sum(i=1, #v, v[i])
a(n)=my(k=n); while(hamming(bitxor(n, k++))!=4, ); k \\ Charles R Greathouse IV, Apr 25 2012
CROSSREFS
Sequence in context: A023457 A004456 A055126 * A273369 A272685 A087979
KEYWORD
nonn,base
AUTHOR
Vladimir Shevelev, Apr 25 2012
EXTENSIONS
Terms corrected by Charles R Greathouse IV, Apr 25 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 23:49 EDT 2024. Contains 372290 sequences. (Running on oeis4.)