|
|
A267480
|
|
Number T(n,k) of words on {1,1,2,2,...,n,n} with longest increasing subsequence of length k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
|
|
5
|
|
|
1, 0, 1, 0, 1, 5, 0, 1, 42, 47, 0, 1, 351, 1527, 641, 0, 1, 3113, 43910, 54987, 11389, 0, 1, 29003, 1302660, 3844840, 2059147, 248749, 0, 1, 280220, 40970298, 265777225, 285588543, 82025038, 6439075, 0, 1, 2782475, 1364750889, 19104601915, 37783672691, 19773928713, 3507289363, 192621953
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,6
|
|
LINKS
|
|
|
FORMULA
|
Sum_{k=0..n-1} T(n,k) = A267532(n).
|
|
EXAMPLE
|
Triangle T(n,k) begins:
1;
0, 1;
0, 1, 5;
0, 1, 42, 47;
0, 1, 351, 1527, 641;
0, 1, 3113, 43910, 54987, 11389;
0, 1, 29003, 1302660, 3844840, 2059147, 248749;
0, 1, 280220, 40970298, 265777225, 285588543, 82025038, 6439075;
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|