id:A027200 - OEIS Search Results

Search: id:A027200

Displaying 1-1 of 1 results found.

page 1

Triangular array T read by rows: T(n,k) = number of partitions of n into an even number of parts, each >=k.

+0
1

0, 1, 0, 1, 0, 0, 3, 1, 0, 0, 3, 1, 0, 0, 0, 6, 2, 1, 0, 0, 0, 7, 2, 1, 0, 0, 0, 0, 12, 4, 2, 1, 0, 0, 0, 0, 14, 4, 2, 1, 0, 0, 0, 0, 0, 22, 6, 3, 2, 1, 0, 0, 0, 0, 0, 27, 7, 3, 2, 1, 0, 0, 0, 0, 0, 0, 40, 11, 5, 3, 2, 1, 0, 0, 0, 0, 0, 0, 49, 12, 5, 3, 2, 1, 0, 0, 0 (list; table; graph; listen)

	OFFSET	`1,7`
	CROSSREFS	`T(n, k) = Sum{E(n, i)}, k<=i<=n, E given by A027186.` `Sequence in context: A036876 A065413 A107131 this_sequence A035654 A085604 A144357` `Adjacent sequences: A027197 A027198 A027199 this_sequence A027201 A027202 A027203`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.

AT&T Labs Research