login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230373 Numbers n such that sigma(sigma*(n)) = sigma*(sigma(n)), where sigma*(n) is the sum of anti-divisors of n (A066417). 1
3, 265, 450, 1989, 18278, 31639, 55474, 71306, 96639, 197518, 267026, 1620723, 1888235, 3605481, 4448715, 10837215, 12128451, 22598820, 84681074, 96503379, 130118331, 152234714, 162138375, 189149834, 211239421, 343379954, 353833749, 404994939, 599244123, 804486314 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..30.

EXAMPLE

Divisors of 450 are 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 45, 50, 75, 90, 150, 225, 450 and sigma(450) = 1209; anti-divisors of 1209 are 2, 6, 26, 41, 59, 62, 78, 186, 806 and sigma*(1209) = 1266.

Anti-divisors of 450 are 4, 12, 17, 20, 29, 31, 36, 53, 60, 100, 180, 300 and sigma*(450) = 842; divisors of 842 are 1, 2, 421, 842 and sigma(842) = 1266.

Therefore 450 is part of the sequence because sigma(sigma*(450)) = sigma*(sigma(450)) = 1266.

MAPLE

with(numtheory); P:=proc(q) local a, b, c, k, j, n;

for n from 3 to q do c:=sigma(n);

k:=0; j:=n; while j mod 2<>1 do k:=k+1; j:=j/2; od;

a:=sigma(2*n+1)+sigma(2*n-1)+sigma(n/2^k)*2^(k+1)-6*n-2;

k:=0; j:=c; while j mod 2<>1 do k:=k+1; j:=j/2; od;

b:=sigma(2*c+1)+sigma(2*c-1)+sigma(c/2^k)*2^(k+1)-6*c-2;

if sigma(a)=b then print(n); fi; od; end: P(10^6);

CROSSREFS

Cf. A000203, A066417.

Sequence in context: A219550 A319587 A058451 * A003761 A216471 A223037

Adjacent sequences:  A230370 A230371 A230372 * A230374 A230375 A230376

KEYWORD

nonn,hard

AUTHOR

Paolo P. Lava, Oct 23 2013

EXTENSIONS

a(12)-a(30) from Giovanni Resta, Oct 23 2013

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 20 04:34 EST 2020. Contains 332063 sequences. (Running on oeis4.)