id:A159458 - OEIS Search Results

Search: id:A159458

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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

	OFFSET	`1,2`
	COMMENT	`n divides A159068(n) for all positive integers n.`
	CROSSREFS	`Cf. A159068, A159069` `Sequence in context: A032357 A144056 A062630 this_sequence A006497 A038912 A019361` `Adjacent sequences: A159455 A159456 A159457 this_sequence A159459 A159460 A159461`
	KEYWORD	`more,nonn`
	AUTHOR	`Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), 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`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.