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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026836 Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts, the greatest being k, for k=1,2,...,n. 6
1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 2, 1, 1, 1, 0, 0, 0, 1, 2, 1, 1, 1, 0, 0, 0, 1, 2, 2, 1, 1, 1, 0, 0, 0, 1, 2, 2, 2, 1, 1, 1, 0, 0, 0, 0, 2, 3, 2, 2, 1, 1, 1, 0, 0, 0, 0, 2, 3, 3, 2, 2, 1, 1, 1, 0, 0, 0, 0, 1, 3, 4, 3, 2, 2, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,25

LINKS

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

Henry Bottomley, Partition calculators using java applets

Index entries for sequences related to partitions

FORMULA

T(n, k) =A070936(n-k, k-1) =A053632(k-1, n-k) =T(n-1, k-1)+T(n-2k+1, k-1). - Henry Bottomley, May 12 2002

T(n, k) = coefficient of x^n in x^k*Product_{i=1..k-1} (1+x^i). - Vladeta Jovovic, Aug 07 2003

CROSSREFS

If seen as a square array then transpose of A070936 and visible form of A053632. Central diagonal and those to the right of center are A000009 as are row sums.

Sequence in context: A059607 A176724 A015318 * A089052 A284606 A284019

Adjacent sequences:  A026833 A026834 A026835 * A026837 A026838 A026839

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified July 22 00:13 EDT 2017. Contains 289648 sequences.