id:A092316 - OEIS Search Results

Search: id:A092316

Displaying 1-1 of 1 results found.

page 1

Sum of largest parts of all partitions of n into odd distinct parts.

+0
4

1, 0, 3, 3, 5, 5, 7, 12, 14, 16, 18, 27, 29, 33, 42, 55, 59, 65, 78, 95, 110, 118, 137, 167, 188, 200, 236, 274, 303, 330, 376, 435, 485, 522, 591, 677, 741, 803, 903, 1022, 1115, 1210, 1345, 1505, 1650, 1784, 1964, 2201, 2393, 2578, 2843, 3143, 3409, 3685, 4034 (list; graph; listen)

	OFFSET	`1,3`
	FORMULA	`G.f.: Sum((2n-1)x^(2n-1)Product(1+x^(2*k-1), k = 1 .. n-1), n = 1 .. infinity).`
	CROSSREFS	`Cf. A092319.` `Sequence in context: A077381 A157966 A087715 this_sequence A142456 A098508 A051593` `Adjacent sequences: A092313 A092314 A092315 this_sequence A092317 A092318 A092319`
	KEYWORD	`easy,nonn`
	AUTHOR	`Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 15 2004`
	EXTENSIONS	`More terms from Pab Ter (pabrlos(AT)yahoo.com), May 25 2004`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research