A394905 - OEIS

A394905

Smallest number k > n such that the binary Hamming distance between n and k is equal to the number of runs in the binary representation of n, and k has more runs than n.

%I #17 Apr 14 2026 22:44:03

%S 5,11,11,13,22,10,23,11,21,45,18,20,20,22,47,19,22,43,20,45,90,37,26,

%T 27,40,41,41,44,37,46,95,35,38,45,36,43,86,41,41,53,85,181,82,69,74,

%U 53,53,51,54,74,52,69,82,83,58,59,73,75,75,92,77,94,191,67,70

%N Smallest number k > n such that the binary Hamming distance between n and k is equal to the number of runs in the binary representation of n, and k has more runs than n.

%H Vincenzo Manto, <a href="/A394905/b394905.txt">Table of n, a(n) for n = 1..500</a>

%F a(n) = min { k > n : d_H(n, k) = R(n) and R(k) > R(n) }.

%Y Cf. A044813, A005811.

%K nonn

%O 1,1

%A _Vincenzo Manto_, Apr 06 2026