A214489 Numbers m such that A070939(m) = A070939(m + A070939(m)), A070939 = length of binary representation.

0, 4, 8, 9, 10, 11, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86

Offset: 1

Author

Reinhard Zumkeller, Jul 21 2012

Keywords

• nonn

Comments

A070939(a(n))=A103586(a(n)) and also A105025(a(n))=A105029(a(n)).

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
• David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [pdf, ps].
• Index entries for sequences related to binary expansion of n

Programs

Haskell

a214489 n = a214489_list !! (n-1)
a214489_list = [x | x <- [0..], a070939 x == a103586 x]
-- .