id:A062379 - OEIS Search Results

Search: id:A062379

Displaying 1-1 of 1 results found.

page 1

n divided by largest 4th-power-free factor of n.

+0
3

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, 4, 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, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,16`
	LINKS	`H. Bottomley, Some Smarandache-type multiplicative sequences`
	FORMULA	`a(n) = n/A058035(n).`
	CROSSREFS	`Cf. A000190, A000583, A008835, A053164, A053165, A053166, A053167, A056553, A056554, A056555, A058035. See A003557 for squares and A062378 for cubes.` `Sequence in context: A063775 A053164 A055229 this_sequence A043288 A057523 A083535` `Adjacent sequences: A062376 A062377 A062378 this_sequence A062380 A062381 A062382`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 18 2001`

page 1

Search completed in 0.002 seconds

Last modified August 28 19:25 EDT 2008. Contains 143183 sequences.

AT&T Labs Research