id:A027186 - OEIS Search Results

Search: id:A027186

Displaying 1-1 of 1 results found.

page 1

Triangular array E by rows: E(n,k) = number of partitions of n into an even number of parts, the least being k.

+0
4

0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0, 0, 4, 1, 1, 0, 0, 0, 5, 1, 1, 0, 0, 0, 0, 8, 2, 1, 1, 0, 0, 0, 0, 10, 2, 1, 1, 0, 0, 0, 0, 0, 16, 3, 1, 1, 1, 0, 0, 0, 0, 0, 20, 4, 1, 1, 1, 0, 0, 0, 0, 0, 0, 29, 6, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 37, 7, 2, 1, 1, 1, 0, 0, 0, 0 (list; table; graph; listen)

	OFFSET	`1,7`
	CROSSREFS	`E(n, k) = O(n-k, k)+O(n-k, k+1)+...+O(n-k, n-k), for 2<=2k<=n, O given by A027185.` `Sequence in context: A035219 A106347 A124300 this_sequence A131962 A168313 A072575` `Adjacent sequences: A027183 A027184 A027185 this_sequence A027187 A027188 A027189`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified March 19 01:26 EDT 2010. Contains 173632 sequences.

AT&T Labs Research