id:A027185 - OEIS Search Results

Search: id:A027185

Displaying 1-1 of 1 results found.

page 1

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

+0
4

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

	OFFSET	`1,11`
	CROSSREFS	`O(n, k) = E(n-k, k)+E(n-k, k+1)+...+E(n-k, n-k), for 2<=2k<=n, E given by A027186.` `Sequence in context: A089313 A052998 A114516 this_sequence A035641 A036873 A081130` `Adjacent sequences: A027182 A027183 A027184 this_sequence A027186 A027187 A027188`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research