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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027200 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, 0, 1, 0, 0, 3, 1, 0, 0, 3, 1, 0, 0, 0, 6, 2, 1, 0, 0, 0, 7, 2, 1, 0, 0, 0, 0, 12, 4, 2, 1, 0, 0, 0, 0, 14, 4, 2, 1, 0, 0, 0, 0, 0, 22, 6, 3, 2, 1, 0, 0, 0, 0, 0, 27, 7, 3, 2, 1, 0, 0, 0, 0, 0, 0, 40, 11, 5, 3, 2, 1, 0, 0, 0, 0, 0, 0, 49, 12, 5, 3, 2, 1, 0, 0, 0 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,7

CROSSREFS

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

Sequence in context: A036876 A065413 A107131 * A035654 A170846 A085604

Adjacent sequences:  A027197 A027198 A027199 * A027201 A027202 A027203

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 15 04:59 EST 2012. Contains 205694 sequences.