id:A082299 - OEIS Search Results

Search: id:A082299

Displaying 1-1 of 1 results found.

page 1

Greatest common divisor of n and its sum of prime factors (with repetition).

+0
4

1, 2, 3, 4, 5, 1, 7, 2, 3, 1, 11, 1, 13, 1, 1, 8, 17, 2, 19, 1, 1, 1, 23, 3, 5, 1, 9, 1, 29, 10, 31, 2, 1, 1, 1, 2, 37, 1, 1, 1, 41, 6, 43, 1, 1, 1, 47, 1, 7, 2, 1, 1, 53, 1, 1, 1, 1, 1, 59, 12, 61, 1, 1, 4, 1, 2, 67, 1, 1, 14, 71, 12, 73, 1, 1, 1, 1, 6, 79, 1, 3, 1, 83, 14, 1, 1, 1, 1, 89, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = GCD(n, A001414(n));` `For n > 4, a(n) = n iff n is prime.`
	EXAMPLE	`a(100)=GCD(2255,2+2+5+5)=GCD(225,27)=2;` `a(200)=GCD(22255,2+2+2+5+5)=GCD(2225,2222)=8.`
	CROSSREFS	`Cf. A082300.` `Adjacent sequences: A082296 A082297 A082298 this_sequence A082300 A082301 A082302` `Sequence in context: A026284 A071489 A071514 this_sequence A081806 A059806 A100994`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 08 2003`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research