|
|
A229158
|
|
Triangle T(n,k) read by rows: T(n,k) = number of permutations on 123...n with exactly two abc patterns and no aj pattern with j<=k, for n>=0, 0<=k<=n.
|
|
3
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 1, 0, 0, 24, 24, 12, 2, 0, 0, 133, 133, 74, 23, 3, 0, 0, 635, 635, 371, 141, 36, 4, 0, 0, 2807, 2807, 1688, 709, 227, 51, 5, 0, 0, 11864, 11864, 7276, 3248, 1168, 334, 68, 6, 0, 0, 48756, 48756, 30340, 14121, 5459, 1771, 464, 87, 7, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,11
|
|
COMMENTS
|
See Noonan-Zeilberger for precise definition.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
0,
0,0,
0,0,0,
0,0,0,0,
3,3,1,0,0,
24,24,12,2,0,0,
133,133,74,23,3,0,0,
635,635,371,141,36,4,0,0,
2807,2807,1688,709,227,51,5,0,0,
11864,11864,7276,3248,1168,334,68,6,0,0,
48756,48756,30340,14121,5459,1771,464,87,7,0,0
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|