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

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

1,18

CROSSREFS

E(n, k) = O(n-k, 1)+O(n-k, 2)+...+O(n-k, m), where m=MIN{k, n-k}, n >= 2, O given by A026920.

Sequence in context: A117452 A029412 A178670 * A198568 A157044 A182748

Adjacent sequences:  A026918 A026919 A026920 * A026922 A026923 A026924

KEYWORD

nonn

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 02:30 EST 2012. Contains 205860 sequences.