id:A061592 - OEIS Search Results

Search: id:A061592

Displaying 1-1 of 1 results found.

page 1

Smallest number whose product of divisors is an n-th power.

+0
1

1, 6, 4, 24, 16, 8, 64, 120, 36, 16, 1024, 216, 4096, 128, 32, 840, 65536, 256, 262144, 1680, 64, 2048, 4194304, 216, 1296, 4096, 900, 128, 268435456, 5040, 1073741824, 7560, 2048, 65536, 5184, 256, 68719476736, 524288, 4096, 15120, 1099511627776 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n) = Min{x\|Product[divisors of x] = s^n} = Min{x\|A007955(x) = s^n}`
	EXAMPLE	`n = 31: a(31) = 2^30 since Apply[Times, Divisors[2^30]] = 32768^31. n = 50: a(50) = 1296 because the product of 25 divisors is (6^4)^(25/2) = 6^50.`
	CROSSREFS	`Cf. A007955.` `Sequence in context: A107983 A009278 A120462 this_sequence A081631 A137174 A129886` `Adjacent sequences: A061589 A061590 A061591 this_sequence A061593 A061594 A061595`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), May 22 2001`
	EXTENSIONS	`More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Jun 19 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research