The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A026840 Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts <= k, for k=1,2,...n. 2
 1, 0, 1, 0, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 3, 0, 0, 1, 2, 3, 4, 0, 0, 0, 2, 3, 4, 5, 0, 0, 0, 1, 3, 4, 5, 6, 0, 0, 0, 1, 3, 5, 6, 7, 8, 0, 0, 0, 1, 3, 5, 7, 8, 9, 10, 0, 0, 0, 0, 2, 5, 7, 9, 10, 11, 12, 0, 0, 0, 0, 2, 5, 8, 10, 12, 13, 14, 15, 0, 0, 0, 0, 1, 4, 8, 11 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS CROSSREFS Cf. A026836. Differs from A079126 in having fewer zeros at the ends of the rows. Sequence in context: A130731 A287240 A025875 * A025873 A208589 A112171 Adjacent sequences:  A026837 A026838 A026839 * A026841 A026842 A026843 KEYWORD nonn,tabl AUTHOR 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.

Last modified May 11 13:41 EDT 2021. Contains 343791 sequences. (Running on oeis4.)