|
| |
|
|
A091340
|
|
Amicable numbers with property that each member n of the corresponding amicable pair is divisible by sopfr(n) (sopfr: sum of prime factors with repetition).
|
|
0
|
| |
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
a(2n),a(2n+1) is a pair of amicable numbers for n=0,1,... For each a(m), m=0,1,...: sopfr(a(m)) divides a(m).
Conjecture: sequence is finite, even though there are quite a lot of known amicable numbers (about 6.0E6 currently).
|
|
|
LINKS
|
Table of n, a(n) for n=0..5.
J.M. Pedersen, List of known amicable pairs
J. O. M. Pedersen, Tables of Aliquot Cycles
|
|
|
EXAMPLE
|
a(0): 821921625=3^2*5^3*7*29*59*61, sopfr(n) = 177 = 3*59
a(1): 988676775=3^2*5^2*71*199*311, sopfr(n) = 597 = 3*199
|
|
|
CROSSREFS
|
Cf. A001414.
Sequence in context: A152156 A017540 A132216 * A114665 A182239 A204406
Adjacent sequences: A091337 A091338 A091339 * A091341 A091342 A091343
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Sven Simon, Dec 31 2003
|
|
|
STATUS
|
approved
|
| |
|
|
