|
%I #7 Oct 14 2012 18:03:43
%S 1,6,41,209,1106,5323,26069,122901,585922,2747977,13000269,61088173,
%T 289186846,1366147708,6496681304,30905464864,147912712795,
%U 709073550307,3418258506885,16517431269189,80230551304034,390774361811783,1912602871119956,9388456361080840
%N Number of self-inverse permutations in S_n with longest increasing subsequence of length 6.
%C Also the number of Young tableaux with n cells and 6 rows.
%H Alois P. Heinz, <a href="/A217326/b217326.txt">Table of n, a(n) for n = 6..400</a>
%F a(n) = A182172(n,6)-A182172(n,5) = A007579(n)-A049401(n).
%e a(6) = 1: 123456.
%e a(7) = 6: 1234576, 1234657, 1235467, 1243567, 1324567, 2134567.
%Y Column k=6 of A047884.
%Y Cf. A007579, A049401, A182172.
%K nonn
%O 6,2
%A _Alois P. Heinz_, Sep 30 2012
|
