A159458 - OEIS

This site is supported by donations to The OEIS Foundation.

A159458

Numbers n such that n^2 divides A159068(n), where A159068(n) = sum{k=1 to n} binomial(n,k) * GCD(n,k).

1, 2, 3, 11, 33, 309, 665, 1461, 2323, 6789 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	COMMENTS	`n divides A159068(n) for all positive integers n.`
	CROSSREFS	`Cf. A159068, A159069` `Sequence in context: A032357 A144056 A062630 * A057838 A006497 A038912` `Adjacent sequences: A159455 A159456 A159457 * A159459 A159460 A159461`
	KEYWORD	`more,nonn`
	AUTHOR	`Leroy Quet, Apr 12 2009`
	EXTENSIONS	`4 more terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 16 2009` `a(10)=6789 from Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 19 2009`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 09:27 EST 2012. Contains 205904 sequences.