|
|
A259180
|
|
Amicable pairs.
|
|
56
|
|
|
220, 284, 1184, 1210, 2620, 2924, 5020, 5564, 6232, 6368, 10744, 10856, 12285, 14595, 17296, 18416, 63020, 76084, 66928, 66992, 67095, 71145, 69615, 87633, 79750, 88730, 100485, 124155, 122265, 139815, 122368, 123152, 141664, 153176, 142310, 168730, 171856, 176336, 176272, 180848, 185368, 203432, 196724, 202444, 280540, 365084
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
A pair of numbers x and y is called amicable if the sum of the proper divisors (or aliquot parts) of either one is equal to the other.
This is A002025 and A002046 interleaved hence the amicable pairs (x < y), ordered by increasing x, are adjacent to each other in the list.
By definition a property of the amicable pair (x, y) is that x + y = sigma(x) = sigma(y).
Amicable numbers A063990 are the terms of this sequence in increasing order.
First differs from A063990 at a(18).
First differs from A259933 at a(17).
|
|
LINKS
|
E. B. Escott, Amicable numbers, Scripta Mathematica, 12 (1946), 61-72 [Annotated scanned copy]
M. García, J. M. Pedersen, H. J. J. te Riele, Amicable pairs, a survey, Report MAS-R0307, Centrum Wiskunde & Informatica.
|
|
FORMULA
|
|
|
EXAMPLE
|
------------------------------------
Amicable pair Sum
x y x + y
------------------------------------
------------------------------------
1 220 284 504
2 1184 1210 2394
3 2620 2924 5544
4 5020 5564 10584
5 6232 6368 12600
6 10744 10856 21600
7 12285 14595 26880
8 17296 18416 35712
9 63020 76084 139104
10 66928 66992 133920
11 67095 71145 138240
12 69615 87633 157248
... ... ... ...
The sum of the proper divisors (or aliquot parts) of 220 is 1 + 2 + 4 + 5 + 10 + 11 + 20 + 22 + 44 + 55 + 110 = 284. On the other hand the sum of the proper divisors (or aliquot parts) of 284 is 1 + 2 + 4 + 71 + 142 = 220. Note that 220 + 284 = sigma(220) = sigma(284) = 504. The smallest amicable pair is (220, 284), so a(1) = 220 and a(2) = 284.
|
|
MATHEMATICA
|
f[n_] := Block[{s = {}, g, k}, g[x_] := DivisorSigma[1, x] - x; Do[k = g@ i; If[And[g@ k == i, k != i, ! MemberQ[s, i]], s = s~Join~{i, k}], {i, n}]; s]; f@ 300000 (* Michael De Vlieger, Jul 02 2015 *)
|
|
PROG
|
(PARI) A259180_upto(N, L=List(), s)={ forfactored(n=1, N, (s=sigma(n[2]))>2*n[1] && sigma(s-n[1])==s && listput(L, [n[1], s-n[1]])); concat(L)} \\ M. F. Hasler, Oct 11 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|