id:A112995 - OEIS Search Results

Search: id:A112995

Displaying 1-1 of 1 results found.

page 1

Triangular array T(n,k)=number of partitions of n in which the least part is <=k, for 1<=k<=n, n>=1.

+0
1

1, 1, 2, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 6, 7, 7, 9, 10, 10, 10, 11, 11, 13, 14, 14, 14, 14, 15, 15, 19, 20, 21, 21, 21, 21, 22, 22, 26, 28, 29, 29, 29, 29, 29, 30, 30, 37, 39, 40, 41, 41, 41, 41, 41, 42, 42, 50, 53, 54, 55, 55, 55, 55, 55, 55, 56, 56, 68, 72, 74, 75, 76, 76, 76, 76 (list; table; graph; listen)

	OFFSET	`1,3`
	COMMENT	`The partition sequence A000041 occurs here as T(n,0) and also essentially as T(n,n).`
	FORMULA	`Row n of T consists of the partial sums of row n of the array in A026794.`
	EXAMPLE	`The first five rows:` `1` `1 2` `2 2 3` `3 4 4 5` `5 6 6 6 7` `Row 5 of A026794, namely 5 1 0 0 1, has partial sums 5 6 6 6 7.`
	CROSSREFS	`Cf. A000041, A026794.` `Adjacent sequences: A112992 A112993 A112994 this_sequence A112996 A112997 A112998` `Sequence in context: A029125 A074990 A102605 this_sequence A078452 A135636 A025795`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), Oct 08 2005`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research