This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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
 821921625, 988676775, 4024942087978, 4179223134422, 100733767393275, 110452715806725 (list; graph; refs; listen; history; text; internal format)
 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 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .