login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122967 Greatest prime factor of the pair of amicable numbers. Amicable numbers are sorted by the smaller number in the pair. 2
71, 37, 131, 251, 199, 79, 139, 1151, 827, 89, 71, 107, 467, 89, 239, 239, 467, 359, 467, 479, 431, 263, 853, 2267, 433, 251, 1439, 2393, 1367, 47, 863, 449, 1217, 701, 4799, 89, 1879, 433, 1063, 2609, 269, 5669, 239, 2099, 6803, 251, 3923, 199, 929, 227, 5119 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)

FORMULA

a(n) = max(A006530(A002025(n)), A006530(A002046(n))). - R. J. Mathar, Nov 10 2006

EXAMPLE

220 = 2^2*5*11, 284 = 2^2*71. The greatest prime factor in the pair is 71.

CROSSREFS

Cf. A002025, A002046, A006530, A063990 (amicable numbers), A061469 (GCD of the amicable pairs).

Sequence in context: A350007 A128856 A033391 * A087075 A095936 A104843

Adjacent sequences: A122964 A122965 A122966 * A122968 A122969 A122970

KEYWORD

nonn

AUTHOR

Tanya Khovanova, Oct 27 2006

EXTENSIONS

More terms from R. J. Mathar, Nov 10 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 21:00 EST 2022. Contains 358648 sequences. (Running on oeis4.)