A214433 Where A105025 and A105027 agree.

0, 1, 2, 3, 9, 10, 13, 14, 34, 37, 42, 45, 50, 53, 58, 61, 517, 522, 533, 538, 549, 554, 565, 570, 581, 586, 597, 602, 613, 618, 629, 634, 645, 650, 661, 666, 677, 682, 693, 698, 709, 714, 725, 730, 741, 746, 757, 762, 773, 778, 789, 794, 805, 810, 821, 826

Offset: 1

Author

Reinhard Zumkeller, Jul 21 2012

Keywords

• nonn
• base

Comments

A105025(a(n)) = A105027(a(n)).

Examples

			A105025(1018) = A105027(1018) = 1011, => 1018 is a term: a(80) = 1018;
A105025(1019) = 994 and A105027(1019) = 1014, => 1019 not a term;
A105025(524302) = A105027(524302) = 524317, => a(81) = 524302;
A105025(524303) = 524312 and A105027(524303) = 524300, => 524302 not a term.
-
		

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].

Crossrefs

Cf. A214489.

Programs

Haskell

a214433 n = a214433_list !! (n-1)
a214433_list = [x | x <- [0..], a105025 x == a105027 x]