id:A026921 - OEIS Search Results

Search: id:A026921

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

+0
2

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

	OFFSET	`1,18`
	CROSSREFS	`E(n, k) = O(n-k, 1)+O(n-k, 2)+...+O(n-k, m), where m=MIN{k, n-k}, n >= 2, O given by A026920.` `Sequence in context: A152800 A117452 A029412 this_sequence A157044 A025879 A125753` `Adjacent sequences: A026918 A026919 A026920 this_sequence A026922 A026923 A026924`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research