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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027199 Triangular array T read by rows: T(n,k) = number of partitions of n into an odd number of parts, each >=k. 0
1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 1, 5, 2, 1, 1, 1, 1, 8, 2, 1, 1, 1, 1, 1, 10, 3, 1, 1, 1, 1, 1, 1, 16, 4, 2, 1, 1, 1, 1, 1, 1, 20, 6, 2, 1, 1, 1, 1, 1, 1, 1, 29, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 37, 10, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 52, 12, 5, 2, 1, 1, 1, 1, 1 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,4

CROSSREFS

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

Sequence in context: A026835 A117975 A143258 * A140218 A193805 A159704

Adjacent sequences:  A027196 A027197 A027198 * A027200 A027201 A027202

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 03:44 EST 2012. Contains 205860 sequences.