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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027186 Triangular array E by rows: E(n,k) = number of partitions of n into an even number of parts, the least being k. 3
0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0, 0, 4, 1, 1, 0, 0, 0, 5, 1, 1, 0, 0, 0, 0, 8, 2, 1, 1, 0, 0, 0, 0, 10, 2, 1, 1, 0, 0, 0, 0, 0, 16, 3, 1, 1, 1, 0, 0, 0, 0, 0, 20, 4, 1, 1, 1, 0, 0, 0, 0, 0, 0, 29, 6, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 37, 7, 2, 1, 1, 1, 0, 0, 0, 0 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,7

CROSSREFS

E(n, k) = O(n-k, k)+O(n-k, k+1)+...+O(n-k, n-k), for 2<=2k<=n, O given by A027185.

Sequence in context: A106347 A124300 A154326 * A131962 A168313 A072575

Adjacent sequences:  A027183 A027184 A027185 * A027187 A027188 A027189

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 13 19:04 EST 2012. Contains 205535 sequences.