id:A026932 - OEIS Search Results

Search: id:A026932

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, 1, 0, 1, 1, 1, 2, 3, 3, 0, 1, 2, 3, 3, 1, 2, 4, 5, 6, 6, 0, 2, 3, 5, 6, 7, 7, 1, 3, 6, 8, 10, 11, 12, 12, 0, 2, 5, 8, 10, 12, 13, 14, 14, 1, 3, 8, 12, 16, 18, 20, 21, 22, 22, 0, 3, 7, 13, 17, 21, 23, 25, 26, 27, 27, 1, 4, 11, 18, 25, 30, 34, 36, 38 (list; table; graph; listen)

	OFFSET	`1,8`
	CROSSREFS	`T(n, k) = Sum{E(n, i)}, 1<=i<=k, E given by A027186.` `Sequence in context: A019228 A075121 A075108 this_sequence A087401 A127572 A021815` `Adjacent sequences: A026929 A026930 A026931 this_sequence A026933 A026934 A026935`
	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