This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A182336 #14 Feb 01 2014 07:31:19 %S A182336 15,14,13,12,11,10,9,8,19,18,17,16,17,16,16,17,31,30,29,28,27,26,25, %T A182336 24,33,32,32,33,32,33,34,35,47,46,45,44,43,42,41,40,51,50,49,48,49,48, %U A182336 48,49,63,62,61,60,59,58,57,56,64,65,66,67,68,69,70,71,79,78,77,76,75,74 %N A182336 a(n) is the least m>=n, such that the Hamming distance D(n,m)=4. %C A182336 Or (see comment in A206853) a(n)=n<+>4. %C A182336 Conjecture: for n > 96, n + 1 <= a(n) <= 9n/8 + 1. - _Charles R Greathouse IV_, Apr 25 2012 %H A182336 Charles R Greathouse IV, <a href="/A182336/b182336.txt">Table of n, a(n) for n = 0..10000</a> %o A182336 (PARI) hamming(n)=my(v=binary(n));sum(i=1,#v,v[i]) %o A182336 a(n)=my(k=n);while(hamming(bitxor(n,k++))!=4,);k \\ _Charles R Greathouse IV_, Apr 25 2012 %Y A182336 Cf. A205509, A205510, A205511, A205302, A205649, A205533, A122565, A206852, A206853, A206960, A207063, A209544, A209554, A007814, A086799, A182187, A182209. %K A182336 nonn,base %O A182336 0,1 %A A182336 _Vladimir Shevelev_, Apr 25 2012 %E A182336 Terms corrected by _Charles R Greathouse IV_, Apr 25 2012