id:A073752 - OEIS Search Results

Search: id:A073752

Displaying 1-1 of 1 results found.

page 1

Greatest common divisor of n/spf(n) and n/gpf(n) where spf(n) is the smallest and gpf(n) is the greatest prime factor of n (see A020639, A006530).

+0
3

1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 2, 1, 1, 1, 8, 1, 3, 1, 2, 1, 1, 1, 4, 5, 1, 9, 2, 1, 3, 1, 16, 1, 1, 1, 6, 1, 1, 1, 4, 1, 3, 1, 2, 3, 1, 1, 8, 7, 5, 1, 2, 1, 9, 1, 4, 1, 1, 1, 6, 1, 1, 3, 32, 1, 3, 1, 2, 1, 5, 1, 12, 1, 1, 5, 2, 1, 3, 1, 8, 27, 1, 1, 6, 1, 1, 1, 4, 1, 9, 1, 2, 1, 1, 1, 16, 1, 7, 3, 10, 1 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n) = if n=p^k (p prime, k>0) then p^(k-1) else n/(spf(n)*gpf(n)).`
	FORMULA	`a(n) = GCD(A032742(n), A052126(n)).`
	CROSSREFS	`Cf. A000961, A066048.` `A073753(n) = a(a(n)).` `Adjacent sequences: A073749 A073750 A073751 this_sequence A073753 A073754 A073755` `Sequence in context: A000189 A000190 A003557 this_sequence A128708 A087653 A140274`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 07 2002`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research