|
Search: id:A047887
|
|
|
| A047887 |
|
Triangle of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n). |
|
+0
3
|
|
| 1, 1, 2, 1, 5, 6, 1, 14, 23, 24, 1, 42, 103, 119, 120, 1, 132, 513, 694, 719, 720, 1, 429, 2761, 4582, 5003, 5039, 5040, 1, 1430, 15767, 33324, 39429, 40270, 40319, 40320, 1, 4862, 94359, 261808, 344837, 361302, 362815, 362879, 362880, 1, 16796
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
Gessel, Ira M.; Symmetric functions and P-recursiveness. J. Combin. Theory Ser. A 53 (1990), no. 2, 257-285.
|
|
EXAMPLE
|
1; 1 2; 1 5 6; 1 14 23 24;...
|
|
CROSSREFS
|
Rows are partial sums of A047874. Cf. A047888.
Sequence in context: A054651 A145324 A107783 this_sequence A120986 A095801 A128567
Adjacent sequences: A047884 A047885 A047886 this_sequence A047888 A047889 A047890
|
|
KEYWORD
|
nonn,easy,nice,tabl
|
|
AUTHOR
|
Eric Rains (rains(AT)caltech.edu), N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Mar 01 2002
|
|
|
Search completed in 0.002 seconds
|
