login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A210732 Numbers n for which sigma*(n)=sigma*(x)+sigma*(y), where n=x+y and sigma*(n) is the sum of the anti-divisors of n. 2

%I #8 May 16 2012 11:58:13

%S 6,9,15,18,21,24,27,30,31,33,37,39,43,44,46,47,53,56,57,62,65,66,70,

%T 73,74,75,76,78,81,83,86,88,90,91,92,93,97,99,102,103,106,107,109,110,

%U 114,116,117,118,119,121,122,123,125,126,127,129,131,133,135,136

%N Numbers n for which sigma*(n)=sigma*(x)+sigma*(y), where n=x+y and sigma*(n) is the sum of the anti-divisors of n.

%C Similar to A211223 but using anti-divisors.

%e sigma*(127)=sigma*(45)+sigma*(82) that is 212=86+126.

%e In more than one way:

%e sigma*(133)=sigma*(50)+sigma*(83)=sigma*(52)+sigma*(81) that is

%e 204=80+124=94+110.

%p with(numtheory);

%p A210732:=proc(q)

%p local a,b,c,i,j,k,n;

%p for n from 3 to q do

%p a:=0;

%p for k from 2 to n-1 do if abs((n mod k)-k/2)<1 then a:=a+k; fi; od;

%p for i from 1 to trunc(n/2) do

%p b:=0; c:=0;

%p for k from 2 to i-1 do if abs((i mod k)-k/2)<1 then b:=b+k; fi; od;

%p for k from 2 to n-i-1 do if abs(((n-i) mod k)-k/2)<1 then c:=c+k; fi; od;

%p if a=b+c then print(n); break; fi;

%p od;

%p od; end:

%p A210732(10000);

%Y Cf. A066272, A066417, A083207, A204830, A204831, A211223-A211225.

%K nonn

%O 3,1

%A _Paolo P. Lava_, May 10 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 06:58 EDT 2024. Contains 371906 sequences. (Running on oeis4.)