id:A009194 - OEIS Search Results

Search: id:A009194

Displaying 1-1 of 1 results found.

page 1

GCD(n, sigma(n)).

+0
7

1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 4, 1, 2, 3, 1, 1, 3, 1, 2, 1, 2, 1, 12, 1, 2, 1, 28, 1, 6, 1, 1, 3, 2, 1, 1, 1, 2, 1, 10, 1, 6, 1, 4, 3, 2, 1, 4, 1, 1, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 1, 1, 6, 1, 2, 3, 2, 1, 3, 1, 2, 1, 4, 1, 6, 1, 2, 1, 2, 1, 28, 1, 2, 3, 4, 1, 18, 7, 4, 1, 2, 5, 12, 1, 1, 3, 1, 1, 6, 1, 2 (list; graph; listen)

	OFFSET	`1,6`
	COMMENT	`Also LCM of common divisors of n and sigma[n]. It equals n if n is multiply perfect. - Labos E. (labos(AT)ana.sote.hu), Aug 14 2002`
	CROSSREFS	`Adjacent sequences: A009191 A009192 A009193 this_sequence A009195 A009196 A009197` `Sequence in context: A143532 A080219 A040037 this_sequence A007732 A126795 A064793`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified October 15 09:18 EDT 2008. Contains 145015 sequences.

AT&T Labs Research