id:A027355 - OEIS Search Results

Search: id:A027355

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`1,29`
	CROSSREFS	`Sequence in context: A106822 A064532 A025926 this_sequence A127326 A064663 A025923` `Adjacent sequences: A027352 A027353 A027354 this_sequence A027356 A027357 A027358`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified September 5 17:15 EDT 2008. Contains 143476 sequences.

AT&T Labs Research