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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A027345 Triangular array T given by rows: T(n,k) = number of partitions of n into distinct odd parts, the least being k. 2
 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,79 LINKS Table of n, a(n) for n=1..91. EXAMPLE 1; 0,0; 0,0,1; 1,0,0,0; ... CROSSREFS Sequence in context: A303709 A185778 A071164 * A328959 A086080 A369054 Adjacent sequences: A027342 A027343 A027344 * A027346 A027347 A027348 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 8 14:54 EDT 2024. Contains 375753 sequences. (Running on oeis4.)