id:A026920 - OEIS Search Results

Search: id:A026920

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 greatest being k.

+0
2

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

	OFFSET	`1,17`
	CROSSREFS	`O(n, k) = E(n-k, 1)+E(n-k, 2)+...+E(n-k, m), where m=MIN{k, n-k}, n >= 2, E given by A026921.` `Sequence in context: A033665 A104234 A037870 this_sequence A060763 A131576 A100073` `Adjacent sequences: A026917 A026918 A026919 this_sequence A026921 A026922 A026923`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research