id:A061469 - OEIS Search Results

Search: id:A061469

Displaying 1-1 of 1 results found.

page 1

GCD of the amicable pairs: a(n) = GCD(A002025(n), A002046(n)).

+0
2

4, 2, 4, 4, 8, 8, 105, 16, 92, 16, 135, 819, 10, 45, 585, 16, 8, 10, 16, 16, 8, 4, 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; listen)

	OFFSET	`0,1`
	COMMENT	`The pairs are ordered by the smaller number. - David Wasserman (wasserma(AT)spawar.navy.mil), Jun 18 2002`
	EXAMPLE	`a(1)=GCD(220,284)=4; a(2)=GCD(1184,1210)=2.`
	CROSSREFS	`Cf. A002025 A002026.` `Cf. A002046.` `Sequence in context: A103859 A007400 A019921 this_sequence A021706 A131953 A007005` `Adjacent sequences: A061466 A061467 A061468 this_sequence A061470 A061471 A061472`
	KEYWORD	`nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jun 11 2001`
	EXTENSIONS	`More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 18 2002`

page 1

Search completed in 0.002 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research