A112995 Triangular array T(n,k)=number of partitions of n in which the least part is <=k, for 1<=k<=n, n>=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

Offset

1,3

Comments

The partition sequence A000041 occurs here as T(n,0) and also essentially as T(n,n).

Links

Table of n, a(n) for n=1..75.

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.

Sequence in context: A029125 A074990 A102605 * A368887 A078452 A263997

Adjacent sequences: A112992 A112993 A112994 * A112996 A112997 A112998

Keyword

nonn,tabl

Author

Clark Kimberling, Oct 08 2005

Status

approved