id:A053166 - OEIS Search Results

Search: id:A053166

Displaying 1-1 of 1 results found.

page 1

Smallest positive integer for which n divides a(n)^4.

+0
7

1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 6, 13, 14, 15, 2, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 30, 31, 4, 33, 34, 35, 6, 37, 38, 39, 10, 41, 42, 43, 22, 15, 46, 47, 6, 7, 10, 51, 26, 53, 6, 55, 14, 57, 58, 59, 30, 61, 62, 21, 4, 65, 66, 67, 34, 69, 70, 71, 6, 73, 74, 15, 38 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`If n is 5-th-power-free (i.e. not 32, 64, 128, 243, ...) then a(n)=A007947(n).` `Multiplicative with a(p^e) = p^(ceiling(k/4)). Christian G. Bower (bowerc(AT)usa.net) May 16, 2005.`
	LINKS	`H. Bottomley, Some Smarandache-type multiplicative sequences` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.`
	FORMULA	`a(n) = n/A000190(n) = A019554(n)/(A008835(A019554(n)^2))^(1/4).`
	CROSSREFS	`Cf. A000190, A008835, A019554, A019555, A015051.` `Sequence in context: A015053 A062953 A015052 this_sequence A019555 A052410 A072775` `Adjacent sequences: A053163 A053164 A053165 this_sequence A053167 A053168 A053169`
	KEYWORD	`nonn,mult`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Feb 29 2000`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research