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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026932 Triangular array T read by rows: T(n,k) = number of partitions of n into an even number of parts, each <= k. 0
0, 1, 1, 0, 1, 1, 1, 2, 3, 3, 0, 1, 2, 3, 3, 1, 2, 4, 5, 6, 6, 0, 2, 3, 5, 6, 7, 7, 1, 3, 6, 8, 10, 11, 12, 12, 0, 2, 5, 8, 10, 12, 13, 14, 14, 1, 3, 8, 12, 16, 18, 20, 21, 22, 22, 0, 3, 7, 13, 17, 21, 23, 25, 26, 27, 27, 1, 4, 11, 18, 25, 30, 34, 36, 38 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,8

CROSSREFS

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

Sequence in context: A075121 A075108 A190146 * A087401 A192498 A127572

Adjacent sequences:  A026929 A026930 A026931 * A026933 A026934 A026935

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.