id:A085731 - OEIS Search Results

Search: id:A085731

Displaying 1-1 of 1 results found.

page 1

Greatest common divisor of n and its arithmetic derivative.

+0
2

1, 1, 1, 4, 1, 1, 1, 4, 3, 1, 1, 4, 1, 1, 1, 16, 1, 3, 1, 4, 1, 1, 1, 4, 5, 1, 27, 4, 1, 1, 1, 16, 1, 1, 1, 12, 1, 1, 1, 4, 1, 1, 1, 4, 3, 1, 1, 16, 7, 5, 1, 4, 1, 27, 1, 4, 1, 1, 1, 4, 1, 1, 3, 64, 1, 1, 1, 4, 1, 1, 1, 12, 1, 1, 5, 4, 1, 1, 1, 16, 27, 1, 1, 4, 1, 1, 1, 4, 1, 3, 1, 4, 1, 1, 1, 16 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n) = GCD(n, A003415(n));` `a(n) = 1 iff n is square-free (A005117).` `This sequence is very probably multiplicative. - Mitch Harris, Apr 19 2005`
	CROSSREFS	`Sequence in context: A134835 A031278 A010328 this_sequence A131301 A083730 A008833` `Adjacent sequences: A085728 A085729 A085730 this_sequence A085732 A085733 A085734`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jul 20 2003`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research