|
%I #9 Dec 04 2017 18:36:22
%S 1,1,2,1,4,0,14,1,13,2,26,12,28,4,14,1,16,5,50,6,26,8,62,20,55,26,22,
%T 0,44,20,38,1,50,22,62,53,100,16,62,30,104,20,122,4,28,52,118,36,121,
%U 11,38,14,84,20,110,24,98,42,74,80,76,44,62,1,118,20,194,26,122,12,206,85,200,98,42,28,74,20,214,46,121
%N Reversing binary representation of the deficiency of n, A033879(n).
%C For all n, A010060(a(A005100(n)) = 1 and A010060(a(A023196(n))) = 0. That is, for the deficient numbers a(n) is an odious number (A000069) and for the nondeficient numbers a(n) is an evil number (A001969).
%H Antti Karttunen, <a href="/A295881/b295881.txt">Table of n, a(n) for n = 1..16384</a>
%F If A033879(n) <= 0, a(n) = A048724(-A033879(n)), otherwise a(n) = A065621(A033879(n)).
%F For all n >= 1, A065620(a(n)) = A033879(n).
%o (Scheme) (define (A295881 n) (let ((x (A033879 n))) (if (<= x 0) (A048724 (- x)) (A065621 x))))
%Y Cf. A005100, A023196, A033879, A033880, A048724, A065620, A065621, A286449, A295882.
%Y Cf. A000396 (gives the positions of zeros).
%K nonn
%O 1,3
%A _Antti Karttunen_, Dec 04 2017
|
