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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027355 Triangular array T read by rows: T(n,k) = number of partitions into distinct odd parts, all >= k. 0
 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 0, 0, 0, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,29 LINKS Table of n, a(n) for n=1..90. FORMULA T(n, k) = A000700(n) - Sum_{j=0..k-1} A027345(n, j). - Sean A. Irvine, Oct 27 2019 EXAMPLE Triangle begins: 1; 0, 0; 1, 1, 1; 1, 0, 0, 0; 1, 1, 1, 1, 1; 1, 0, 0, 0, 0, 0; ... CROSSREFS Cf. A000700, A027345. Sequence in context: A287146 A025926 A175134 * A127326 A321923 A064663 Adjacent sequences: A027352 A027353 A027354 * A027356 A027357 A027358 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 September 16 23:59 EDT 2024. Contains 375984 sequences. (Running on oeis4.)