The number of permutations containing exactly one increasing subsequence of length three

被引：32

作者：

Noonan, J ^{[1
]}

机构：

[1] TEMPLE UNIV,DEPT MATH,PHILADELPHIA,PA 19122

来源：

DISCRETE MATHEMATICS | 1996年 / 152卷 / 1-3期

关键词：

D O I：

10.1016/0012-365X(95)00247-T

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

It is proved that the number of permuations on {1, 2, ..., n} with exactly one increasing subsequence of length 3 is [GRAPHICS] [0, 0, 1, 6, 27, 119, 429, ... (Sloane A3517)].

引用

页码：307 / 313

页数：7