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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059619 As upper right triangle, number of strongly unimodal partitions of n (strongly unimodal means strictly increasing then strictly decreasing) where initial part is k. 2
1, 1, 1, 1, 0, 1, 3, 1, 1, 1, 4, 2, 0, 1, 1, 6, 2, 1, 1, 1, 1, 10, 4, 2, 1, 1, 1, 1, 15, 6, 3, 1, 2, 1, 1, 1, 21, 9, 4, 2, 1, 2, 1, 1, 1, 30, 12, 6, 3, 2, 2, 2, 1, 1, 1, 43, 18, 8, 5, 3, 2, 2, 2, 1, 1, 1, 59, 25, 12, 6, 3, 3, 3, 2, 2, 1, 1, 1, 82, 34, 17, 9, 5, 4, 3, 3, 2, 2, 1, 1, 1, 111, 48, 22, 12 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,7

FORMULA

T(n, k)=S(n, k)+sum_j[T(n-k, j)] for j>k, where S(n, k)=A059607(n, k)=sum_j[S(n-k, j)] for k>j [note reversal] with S(0, 0)=1.

EXAMPLE

Rows start: {1,1,1,3,4,6,...}, {1,0,1,2,...}, {1,1,0,...} etc. T(16,6)=8 since 16 can be written as 6+10, 6+9+1, 6+8+2, 6+7+3, 6+7+2+1, 6+5+4+1, 6+5+3+2, or 6+4+3+2+1 (but for example neither 6+6+4 nor 6+8+1+1 which are only weakly unimodal).

CROSSREFS

Top row is A059618 and is sum of other rows (for n>0). Cf. A000009, A000041, A001523, A059607.

Sequence in context: A079110 A079619 A157603 * A098950 A123940 A204120

Adjacent sequences:  A059616 A059617 A059618 * A059620 A059621 A059622

KEYWORD

nonn,tabl

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jan 31 2001

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 17 15:57 EST 2012. Contains 206050 sequences.