login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061469 GCD of the amicable pairs: a(n) = GCD(A002025(n), A002046(n)). 4
4, 2, 4, 4, 8, 8, 105, 16, 92, 16, 135, 819, 10, 45, 585, 16, 8, 10, 16, 16, 8, 44, 4, 4, 14, 8, 16, 98, 16, 585, 8, 8, 8, 8, 8, 4, 8, 105, 16, 8, 135, 8, 10, 50, 10, 5733, 8, 585, 10, 855, 16, 10, 4, 10, 10, 585, 32, 10, 8, 16, 14, 8, 16, 4, 8, 310, 8, 16, 8, 10, 50, 855, 14, 8, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The pairs are ordered by the smaller number. - David Wasserman, Jun 18 2002

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

EXAMPLE

a(1)=GCD(220,284)=4; a(2)=GCD(1184,1210)=2.

CROSSREFS

Cf. A002025, A002046.

Sequence in context: A057697 A019921 A204617 * A222641 A258852 A021706

Adjacent sequences:  A061466 A061467 A061468 * A061470 A061471 A061472

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 11 2001

EXTENSIONS

More terms from David Wasserman, Jun 18 2002

a(22) corrected by T. D. Noe, Aug 15 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified June 25 06:13 EDT 2017. Contains 288709 sequences.