id:A052486 - OEIS Search Results

Search: id:A052486

Displaying 1-1 of 1 results found.

page 1

Achilles numbers - powerful but imperfect: writing n=product(p_i^e_i) then none of the e_i=1 (i.e. powerful(1)) but the highest common factor of the e_i>1 is 1 (so not perfect powers).

+0
6

72, 108, 200, 288, 392, 432, 500, 648, 675, 800, 864, 968, 972, 1125, 1152, 1323, 1352, 1372, 1568, 1800, 1944, 2000, 2312, 2592, 2700, 2888, 3087, 3200, 3267, 3456, 3528, 3872, 3888, 4000, 4232, 4500, 4563, 4608, 5000, 5292, 5324, 5400, 5408, 5488 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000` `Eric Weisstein's World of Mathematics, Achilles Number`
	EXAMPLE	`a(3)=200 because 200=2^3*5^2 and the highest common factor of 3 and 2 is 1.`
	CROSSREFS	`Cf. A001597, A001694, A007916.` `Sequence in context: A118218 A102562 A072412 this_sequence A114128 A143610 A166987` `Adjacent sequences: A052483 A052484 A052485 this_sequence A052487 A052488 A052489`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Mar 16 2000`

page 1

Search completed in 0.002 seconds

Last modified December 21 10:15 EST 2009. Contains 171081 sequences.

AT&T Labs Research