|
Search: id:A117195
|
|
|
| A117195 |
|
Triangle read by rows: T(n,k) = number of partitions into distinct parts having rank k, 0<=k<n. |
|
+0
6
|
|
| 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 2, 1, 1, 1, 0, 1, 1, 0, 2, 1, 2, 1, 1, 1, 0, 1, 0, 1, 1, 2, 2, 2, 1, 1, 1, 0, 1, 0, 1, 2, 2, 2, 2, 2, 1, 1, 1, 0, 1, 0, 1, 1, 3, 2, 3, 2, 2, 1, 1, 1, 0, 1, 0, 1, 2, 2, 4, 2, 3, 2, 2, 1, 1, 1, 0, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
1,40
|
|
|
COMMENT
|
T(n,0) = A010054(n), T(n,1) = 1-A010054(n) for n>1;
A000009(n) = Sum(T(n,k): 0<=k<n);
A117192(n) = Sum(T(n,k)*(1 - k mod 2): 0<=k<n);
A117193(n) = Sum(T(n,k)*(k mod 2): 0<=k<n);
A117194(n) = Sum(T(n,k)*(1 - k mod 2): 0<k<n);
|
|
EXAMPLE
|
T(12,0) = #{} = 0,
T(12,1) = #{5+4+2+1} = 1,
T(12,2) = #{6+3+2+1, 5+4+3} = 2,
T(12,3) = #{6+5+1, 6+4+2} = 2,
T(12,4) = #{7+4+1, 7+3+2} = 2,
T(12,5) = #{8+3+1, 7+5} = 2,
T(12,6) = #{9+2+1, 8+4} = 2,
T(12,7) = #{9+3} = 1,
T(12,8) = #{10+2} = 1,
T(12,9) = #{11+1} = 1,
T(12,10) = #{} = 0,
T(12,11) = #{12} = 1.
|
|
CROSSREFS
|
Cf. A063995, A105806.
Adjacent sequences: A117192 A117193 A117194 this_sequence A117196 A117197 A117198
Sequence in context: A037907 A037801 A053252 this_sequence A107034 A117410 A087810
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 03 2006
|
|
|
Search completed in 0.002 seconds
|
