|
|
A194711
|
|
Triangle read by rows: T(n,k) = number of partitions or zones in the last section of the set of partitions of n that contains k as a part.
|
|
1
|
|
|
1, 1, 1, 2, 0, 1, 3, 1, 0, 1, 5, 1, 1, 0, 1, 7, 2, 1, 1, 0, 1, 11, 2, 2, 1, 1, 0, 1, 15, 4, 2, 1, 1, 1, 0, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
It appears that row n lists A000041(n)-1 together with the row n-2 of the triangle A116598, if n >= 2.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1,
1, 1,
2, 0, 1,
3, 1, 0, 1,
5, 1, 1, 0, 1,
7, 2, 1, 1, 0, 1,
11, 2, 2, 1, 1, 0, 1,
15, 4, 2, 1, 1, 1, 0, 1,
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|