id:A071773 - OEIS Search Results

Search: id:A071773

Displaying 1-1 of 1 results found.

page 1

GCD(sfk(n),n/sfk(n)), where sfk(n)=A007947(n) is the square-free kernel of n.

+0
1

1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 5, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 2, 7, 5, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 5, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 2, 1, 1, 1, 2, 1, 7, 3, 10, 1, 1, 1, 2 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n)=gcd(A007947(n), A003557(n));` `n is square-free iff a(n)=1.`
	LINKS	`Eric Weisstein's World of Mathematics, Squarefree.`
	FORMULA	`Multiplicative with p^e -> p^ceil((e-1)/e), p prime.`
	CROSSREFS	`Cf. A005117.` `Adjacent sequences: A071770 A071771 A071772 this_sequence A071774 A071775 A071776` `Sequence in context: A130777 A046854 A066170 this_sequence A000188 A097886 A088863`
	KEYWORD	`nonn,mult`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jun 24 2002`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research