|
%I #10 Sep 08 2013 19:54:51
%S 0,1,2,3,9,10,13,14,34,37,42,45,50,53,58,61,517,522,533,538,549,554,
%T 565,570,581,586,597,602,613,618,629,634,645,650,661,666,677,682,693,
%U 698,709,714,725,730,741,746,757,762,773,778,789,794,805,810,821,826
%N Where A105025 and A105027 agree.
%C A105025(a(n)) = A105027(a(n)).
%H Reinhard Zumkeller, <a href="/A214433/b214433.txt">Table of n, a(n) for n = 1..10000</a>
%H David Applegate, Benoit Cloitre, Philippe Deléham and N. J. A. Sloane, Sloping binary numbers: a new sequence related to the binary numbers [<a href="http://neilsloane.com/doc/slopey.pdf">pdf</a>, <a href="http://neilsloane.com/doc/slopey.ps">ps</a>].
%e A105025(1018) = A105027(1018) = 1011, => 1018 is a term: a(80) = 1018;
%e A105025(1019) = 994 and A105027(1019) = 1014, => 1019 not a term;
%e A105025(524302) = A105027(524302) = 524317, => a(81) = 524302;
%e A105025(524303) = 524312 and A105027(524303) = 524300, => 524302 not a term.
%e -
%o (Haskell)
%o a214433 n = a214433_list !! (n-1)
%o a214433_list = [x | x <- [0..], a105025 x == a105027 x]
%Y Cf. A214489.
%K nonn,base
%O 1,3
%A _Reinhard Zumkeller_, Jul 21 2012
|
