1,1

There may be other integers in the sequence within the range of those given, but they have yet to be calculated and moreover, some of these given may prove to be primitive friendly.

Abundancy is defined as the ratio of the multiplicative sum-of-divisors function to the integer itself: abund(n) = sigma(n)/n. E.g. abund ( 10 ) = sigma ( 10 ) / 10 = (1+2+5+10) / 10 = 1.8 = 9 / 5.

Integers m and n are friendly iff they have the same abundancy. E.g. abund ( 12 ) = abund ( 234 ) = 7 / 3 ===> 12 and 234 are friends.

Friends m and n are primitive friendly iff they have no common prime factor of the same multiplicity.

Anderson, Claude W. and Hickerson, Dean; Advanced Problem 6020, "Friendly Integers", Amer. Math. Monthly, 1977, V84#1p65-6.

Hickerson, Dean; "Re: Friendly number", post to sci.math newsgroup, 2000, available through groups.google.com.

Walter Nissen, Home Page (listed in lieu of email address)

Walter Nissen, Primitive Friendly Integers and Exclusive Multiples, 2004 post to NMBRTHRY mailing list

66 is a friend of 308, 5456, 89408 and 369053696, but all of these are divisible by 11 and not 121, while 66 is not known to be primitive friendly.

Cf. A014567, A074902, A095738, A095739, A096366.

Sequence in context: A015926 A036207 A039538 this_sequence A121478 A128896 A109750

Adjacent sequences: A095748 A095749 A095750 this_sequence A095752 A095753 A095754

nonn

Walter Nissen Jul 09 2004