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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026931 Triangular array T read by rows: T(n,k) = number of partitions of n into an odd number of parts, each <= k. 0
1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 1, 2, 3, 3, 4, 0, 2, 3, 4, 4, 5, 1, 2, 5, 6, 7, 7, 8, 0, 2, 4, 7, 8, 9, 9, 10, 1, 3, 7, 10, 13, 14, 15, 15, 16, 0, 3, 6, 11, 14, 17, 18, 19, 19, 20, 1, 3, 9, 14, 20, 23, 26, 27, 28, 28, 29, 0, 3, 8, 16, 22, 28, 31, 34, 35, 36 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

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

CROSSREFS

T(n, k) = Sum{O(n, i)}, 1<=i<=k, O given by A027185.

Sequence in context: A025866 A259920 A048881 * A127506 A007968 A236532

Adjacent sequences:  A026928 A026929 A026930 * A026932 A026933 A026934

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 February 25 11:08 EST 2018. Contains 299653 sequences. (Running on oeis4.)