id:A026835 - OEIS Search Results

Search: id:A026835

Displaying 1-1 of 1 results found.

page 1

Triangular array read by rows: T(n,k) = number of partitions of n into distinct parts in which every part is >=k, for k=1,2,...,n.

+0
4

1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 4, 2, 1, 1, 1, 1, 5, 3, 2, 1, 1, 1, 1, 6, 3, 2, 1, 1, 1, 1, 1, 8, 5, 3, 2, 1, 1, 1, 1, 1, 10, 5, 3, 2, 1, 1, 1, 1, 1, 1, 12, 7, 4, 3, 2, 1, 1, 1, 1, 1, 1, 15, 8, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 18, 10, 6, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 22, 12, 7, 4, 3, 2, 1, 1 (list; table; graph; listen)

	OFFSET	`1,4`
	COMMENT	`T(n,1)=A000009(n), T(n,2)=A025147(n) for n>1, T(n,3)=A025148(n) for n>2, T(n,4)=A025149(n) for n>3.`
	FORMULA	`G.f.: Sum_{k>=1} (y^k*(-1+Product_{i>=k} (1+x^i))). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 25 2003`
	CROSSREFS	`Cf. A026807.` `Adjacent sequences: A026832 A026833 A026834 this_sequence A026836 A026837 A026838` `Sequence in context: A073204 A034003 A087156 this_sequence A117975 A143258 A027199`
	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