id:A055491 - OEIS Search Results

Search: id:A055491

Displaying 1-1 of 1 results found.

page 1

Smallest square divisible by n divided by largest square which divides n.

+0
1

1, 4, 9, 1, 25, 36, 49, 4, 1, 100, 121, 9, 169, 196, 225, 1, 289, 4, 361, 25, 441, 484, 529, 36, 1, 676, 9, 49, 841, 900, 961, 4, 1089, 1156, 1225, 1, 1369, 1444, 1521, 100, 1681, 1764, 1849, 121, 25, 2116, 2209, 9, 1, 4, 2601, 169, 2809, 36, 3025, 196, 3249, 3364 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`If n is written as Product(Pj^Ej) then a(n) = Product(Pj^(2*(Ej mod 2)))`
	LINKS	`H. Bottomley, Some Smarandache-type multiplicative sequences`
	FORMULA	`a(n) = A053143(n)/A008833(n) = A007913(n)^2 = (A019554(n)/A000188(n))^2 = A000290(n)/A008833(n)^2`
	EXAMPLE	`a(12) = 36/4 = 9`
	CROSSREFS	`Cf. A056551, A056552.` `Sequence in context: A070638 A152205 A129861 this_sequence A032523 A032760 A129970` `Adjacent sequences: A055488 A055489 A055490 this_sequence A055492 A055493 A055494`
	KEYWORD	`easy,nonn,mult`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 28 2000`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research