cp's OEIS Frontend

A318506 a(n) = A032742(n) OR A001065(n)-A032742(n), where OR is bitwise-or (A003986) and A001065 = sum of proper divisors and A032742 = the largest proper divisor of n.

%I A318506 #10 Aug 28 2018 15:59:25
%S A318506 1,1,1,3,1,3,1,7,3,7,1,14,1,7,5,15,1,13,1,14,7,11,1,28,5,15,13,14,1,
%T A318506 31,1,31,15,19,7,55,1,19,13,30,1,53,1,22,31,23,1,60,7,27,21,30,1,63,
%U A318506 15,60,23,31,1,94,1,31,21,63,15,45,1,58,23,39,1,119,1,39,25,62,11,55,1,106,31,43,1,106,23,43,29,60,1,111,13,62,31
%N A318506 a(n) = A032742(n) OR A001065(n)-A032742(n), where OR is bitwise-or (A003986) and A001065 = sum of proper divisors and A032742 = the largest proper divisor of n.
%H A318506 Antti Karttunen, <a href="/A318506/b318506.txt">Table of n, a(n) for n = 1..65537</a>
%H A318506 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A318506 a(n) = A003986(A032742(n), A318505(n)).
%F A318506 For n > 1, a(n) = A001065(n) - A318508(n).
%o A318506 (PARI)
%o A318506 A001065(n) = (sigma(n)-n);
%o A318506 A032742(n) = if(1==n,n,n/vecmin(factor(n)[,1]));
%o A318506 A318505(n) = if(1==n,0,A001065(n)-A032742(n));
%o A318506 A318506(n) = bitor(A318505(n),A032742(n));
%Y A318506 Cf. A001065, A003986, A032742, A318505, A318507, A318508.
%Y A318506 Cf. also A318456, A318516.
%K A318506 nonn,base
%O A318506 1,4
%A A318506 _Antti Karttunen_, Aug 28 2018