id:A055229 - OEIS Search Results

Search: id:A055229

Displaying 1-1 of 1 results found.

page 1

Greatest common divisor of largest square dividing n and square-free part of n.

+0
30

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1 (list; graph; listen)

	OFFSET	`1,8`
	FORMULA	`a(n) = GCD[A008833(n), A007913(n)]` `Multiplicative with a(p^e)=1 for even e, a(p)=1, a(p^e)=p for odd e>1. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 30 2002`
	CROSSREFS	`A008833, A007913, A000188.` `Sequence in context: A043289 A063775 A053164 this_sequence A062379 A043288 A057523` `Adjacent sequences: A055226 A055227 A055228 this_sequence A055230 A055231 A055232`
	KEYWORD	`nice,nonn,mult`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jun 21 2000`

page 1

Search completed in 0.002 seconds

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.

AT&T Labs Research