id:A026931 - OEIS Search Results

Search: id:A026931

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 odd number of parts, each <= k.

+0
1

1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 1, 2, 3, 3, 4, 0, 2, 3, 4, 4, 5, 1, 2, 5, 6, 7, 7, 8, 0, 2, 4, 7, 8, 9, 9, 10, 1, 3, 7, 10, 13, 14, 15, 15, 16, 0, 3, 6, 11, 14, 17, 18, 19, 19, 20, 1, 3, 9, 14, 20, 23, 26, 27, 28, 28, 29, 0, 3, 8, 16, 22, 28, 31, 34, 35, 36 (list; table; graph; listen)

	OFFSET	`1,6`
	CROSSREFS	`T(n, k) = Sum{O(n, i)}, 1<=i<=k, O given by A027185.` `Adjacent sequences: A026928 A026929 A026930 this_sequence A026932 A026933 A026934` `Sequence in context: A061358 A025866 A048881 this_sequence A127506 A007968 A077763`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research