id:A062378 - OEIS Search Results

Search: id:A062378

Displaying 1-1 of 1 results found.

page 1

n divided by largest cube-free factor of n.

+0
9

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 9, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 2 (list; graph; listen)

	OFFSET	`1,8`
	COMMENT	`Numerator of n/sfk(n)^2, where sfk is the square-free kernel of n (A007947), denominator: A055231. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 10 2002`
	LINKS	`H. Bottomley, Some Smarandache-type multiplicative sequences`
	FORMULA	`a(n) = n/A007948(n).`
	CROSSREFS	`Cf. A000189, A000578, A007948, A008834, A019555, A048798, A050985, A053149, A053150, A056551, A056552. See A003557 for squares and A062379 for 4th powers.` `Sequence in context: A081387 A059895 A117358 this_sequence A073753 A078090 A158854` `Adjacent sequences: A062375 A062376 A062377 this_sequence A062379 A062380 A062381`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 18 2001`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research