The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027354 Triangular array T read by rows: T(n,k) = number of partitions into distinct odd parts, the least being <= k. 0
 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,31 LINKS Table of n, a(n) for n=1..90. FORMULA T(n, k) = Sum_{j=1..k} A027345(n, j). - Sean A. Irvine, Oct 27 2019 CROSSREFS Sequence in context: A283655 A262742 A360078 * A192227 A102673 A085297 Adjacent sequences: A027351 A027352 A027353 * A027355 A027356 A027357 KEYWORD nonn,tabl AUTHOR Clark Kimberling EXTENSIONS Title corrected by Sean A. Irvine, Oct 27 2019 STATUS approved

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

Last modified August 14 03:23 EDT 2024. Contains 375146 sequences. (Running on oeis4.)