login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112995 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, 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; refs; listen; history; text; internal format)
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 * A078452 A263997 A135636

Adjacent sequences:  A112992 A112993 A112994 * A112996 A112997 A112998

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling, Oct 08 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 25 12:01 EDT 2019. Contains 324352 sequences. (Running on oeis4.)