id:A053143 - OEIS Search Results

Search: id:A053143

Displaying 1-1 of 1 results found.

page 1

Smallest square divisible by n.

+0
3

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

	OFFSET	`1,2`
	LINKS	`H. Bottomley, Some Smarandache-type multiplicative sequences`
	FORMULA	`Multiplicative with p^e -> p^(e + e mod 2), p prime. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 09 2003`
	CROSSREFS	`a(n) = n*A007913(n) = A019554(n)^2 = n^2/A008833(n) = (n/A000188(n))^2` `Sequence in context: A078615 A087320 A087321 this_sequence A068238 A087369 A021206` `Adjacent sequences: A053140 A053141 A053142 this_sequence A053144 A053145 A053146`
	KEYWORD	`easy,nonn,mult`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Feb 28 2000`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research