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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A152140 Triangle read by rows: T(n,k) (n>=1, 1<=k<=n) = number of partitions of n into k odd parts. 4
1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 2, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 0, 2, 0, 2, 0, 1, 0, 1, 0, 1, 0, 3, 0, 2, 0, 1, 0, 1, 0, 0, 3, 0, 3, 0, 2, 0, 1, 0, 1, 0, 1, 0, 4, 0, 3, 0, 2, 0, 1, 0, 1, 0, 0, 3, 0, 5, 0, 3, 0, 2, 0, 1, 0, 1, 0, 1, 0, 5, 0, 5, 0, 3 (list; table; graph; refs; listen; history; internal format)
OFFSET

1,24

COMMENTS

The number of partitions of n into k odd parts is equal to the number of partitions of (n+k)/2 into k parts; or equivalently the number of partitions of (n-k)/2 into at most k parts. - Franklin T. Adams-Watters, Sep 25 2009

EXAMPLE

Triangle begins:

1

0 1

0 0 1

0 1 0 1

0 0 1 0 1

0 1 0 1 0 1

0 0 2 0 1 0 1

0 1 0 2 0 1 0 1

0 0 2 0 2 0 1 0 1

0 1 0 3 0 2 0 1 0 1

0 0 3 0 3 0 2 0 1 0 1

0 1 0 4 0 3 0 2 0 1 0 1

0 0 3 0 5 0 3 0 2 0 1 0 1

0 1 0 5 0 5 0 3 0 2 0 1 0 1

0 0 4 0 6 0 5 0 3 0 2 0 1 0 1

0 1 0 7 0 7 0 5 0 3 0 2 0 1 0 1

0 0 4 0 9 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 8 0 10 0 7 0 5 0 3 0 2 0 1 0 1

0 0 5 0 11 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 10 0 13 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 0 5 0 15 0 14 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 12 0 18 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 0 6 0 18 0 20 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 14 0 23 0 21 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 0 6 0 23 0 26 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 16 0 30 0 28 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 0 7 0 27 0 35 0 29 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 19 0 37 0 38 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 0 7 0 34 0 44 0 40 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 21 0 47 0 49 0 41 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 0 8 0 39 0 58 0 52 0 42 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 24 0 57 0 65 0 54 0 42 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 0 8 0 47 0 71 0 70 0 55 0 42 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 27 0 70 0 82 0 73 0 56 0 42 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 0 9 0 54 0 90 0 89 0 75 0 56 0 42 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

0 1 0 30 0 84 0 105 0 94 0 76 0 56 0 42 0 30 0 22 0 15 0 11 0 7 0 5 0 3 0 2 0 1 0 1

CROSSREFS

The row sums are A000009.

Cf. A107379, A152146, A152157.

Sequence in context: A117145 A083912 A157187 * A104975 A191254 A106404

Adjacent sequences:  A152137 A152138 A152139 * A152141 A152142 A152143

KEYWORD

nonn,tabl

AUTHOR

Richard Mathar (mathar(AT)strw.leidenuniv.nl), Sep 25 2009

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 17:11 EST 2012. Contains 205938 sequences.