id:A027359 - OEIS Search Results

Search: id:A027359

Displaying 1-1 of 1 results found.

page 1

Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, all <= k.

+0
1

1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 2, 2, 0, 0, 0, 0, 1, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 0, 0, 0, 0, 0, 0, 1, 1, 2, 2, 2, 2 (list; graph; listen)

	OFFSET	`1,35`
	CROSSREFS	`Sequence in context: A098940 A098939 A033148 this_sequence A035447 A037863 A163536` `Adjacent sequences: A027356 A027357 A027358 this_sequence A027360 A027361 A027362`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research