id:A008833 - OEIS Search Results

Search: id:A008833

Displaying 1-1 of 1 results found.

page 1

Largest square dividing n.

+0
32

1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 4, 1, 1, 1, 16, 1, 9, 1, 4, 1, 1, 1, 4, 25, 1, 9, 4, 1, 1, 1, 16, 1, 1, 1, 36, 1, 1, 1, 4, 1, 1, 1, 4, 9, 1, 1, 16, 49, 25, 1, 4, 1, 9, 1, 4, 1, 1, 1, 4, 1, 1, 9, 64, 1, 1, 1, 4, 1, 1, 1, 36, 1, 1, 25, 4, 1, 1, 1, 16, 81, 1, 1, 4, 1, 1, 1, 4, 1, 9, 1, 4, 1, 1, 1, 16, 1 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`Daniel Forgues, Table of n, a(n) for n=1..100000` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.` `H. Bottomley, Some Smarandache-type multiplicative sequences`
	FORMULA	`a(n) = A000188(n)^2 = n/A007913(n). Cf. A019554.` `Multiplicative with a(p^e) = p^(2[e/2]). - David W. Wilson (davidwwilson(AT)comcast.net), Aug 01, 2001.`
	MAPLE	`with(numtheory): [ seq( expand(nthpow(i, 2)), i=1..200) ];`
	PROGRAM	`(PARI) A008833(n)=n/core(n) [From Michael Porter (michael_b_porter(AT)yahoo.com), Oct 17 2009]`
	CROSSREFS	`Sequence in context: A131301 A083730 A162400 this_sequence A063928 A131299 A073937` `Adjacent sequences: A008830 A008831 A008832 this_sequence A008834 A008835 A008836`
	KEYWORD	`nonn,easy,mult`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 20 2000`

page 1

Search completed in 0.003 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research