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.

5, 11, 11, 13, 22, 10, 23, 11, 21, 45, 18, 20, 20, 22, 47, 19, 22, 43, 20, 45, 90, 37, 26, 27, 40, 41, 41, 44, 37, 46, 95, 35, 38, 45, 36, 43, 86, 41, 41, 53, 85, 181, 82, 69, 74, 53, 53, 51, 54, 74, 52, 69, 82, 83, 58, 59, 73, 75, 75, 92, 77, 94, 191, 67, 70

Offset

1,1

Links

Vincenzo Manto, Table of n, a(n) for n = 1..500

Formula

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

Crossrefs

Cf. A044813, A005811.

Sequence in context: A395802 A061768 A205673 * A245098 A352443 A181667

Adjacent sequences: A394902 A394903 A394904 * A394906 A394907 A394908

Keyword

nonn

Author

Vincenzo Manto, Apr 06 2026

Status

approved