|
| |
|
|
A061199
|
|
Upper right triangle where T(n,k), with k >= n, is number of partitions of k where no part appears more than n times; also partitions of k where no parts are multiples of (n+1).
|
|
3
| |
|
|
1, 0, 1, 0, 1, 2, 0, 2, 2, 3, 0, 2, 4, 4, 5, 0, 3, 5, 6, 6, 7, 0, 4, 7, 9, 10, 10, 11, 0, 5, 9, 12, 13, 14, 14, 15, 0, 6, 13, 16, 19, 20, 21, 21, 22, 0, 8, 16, 22, 25, 27, 28, 29, 29, 30, 0, 10, 22, 29, 34, 37, 39, 40, 41, 41, 42, 0, 12, 27, 38, 44, 49, 51, 53, 54, 55, 55, 56, 0, 15, 36
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,6
|
|
|
EXAMPLE
| Rows start (1,0,0,0,0,...), (1,1,2,2,...), (2,2,4,...), (3,4) etc. A(2,4)=4 since the possible partitions of 4 are on the first definition (no term more than twice) 1+1+2, 2+2, 1+3, or 4 and on the second definition (no term a multiple of 3) 1+1+1+1, 1+1+2, 2+2, or 4.
|
|
|
CROSSREFS
| Rows effectively include A000007, A000009, A000726, A035959. Main diagonal is A000041. A061198 is the same table but includes cases where n>k.
Sequence in context: A101276 A103863 A166395 * A144741 A103615 A159632
Adjacent sequences: A061196 A061197 A061198 * A061200 A061201 A061202
|
|
|
KEYWORD
| nonn,tabl
|
|
|
AUTHOR
| Henry Bottomley (se16(AT)btinternet.com), Apr 20 2001
|
| |
|
|
