id:A118375 - OEIS Search Results

Search: id:A118375

Displaying 1-1 of 1 results found.

page 1

Minimum over all permutations b of 1..n of sum b(i)*b^{-1}(i).

+0
1

1, 5, 11, 20, 35, 57, 85, 120, 165, 221, 287, 364, 455, 561, 681, 816, 969, 1141, 1331, 1540, 1771, 2025, 2301, 2600, 2925, 3277, 3655, 4060, 4495, 4961, 5457, 5984, 6545, 7141, 7771, 8436, 9139, 9881, 10661, 11480, 12341, 13245, 14191, 15180, 16215 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`The maximum obtainable is A000330, the square pyramidal numbers. Problem suggested by Leroy Quet.`
	LINKS	`sci.math thread.`
	FORMULA	`a(n) = T(n) + e(n), where T(n) = n(n+1)(n+2)/6 = A000292(n) is the tetrahedal numbers, and e(n) = 0 if n = 0,1 (mod 4) and 1 if n = 2,3 (mod 4). (Published by Rob Johnson in sci.math.)`
	CROSSREFS	`Cf. A000292, A000330.` `Sequence in context: A032527 A026038 A080957 this_sequence A099400 A139534 A093328` `Adjacent sequences: A118372 A118373 A118374 this_sequence A118376 A118377 A118378`
	KEYWORD	`nonn`
	AUTHOR	`Frank Adams-Watters (FrankTAW(AT)Netscape.net), May 15 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research