login
Number of self-inverse permutations in S_n with longest increasing subsequence of length 9.
2

%I #7 Oct 14 2012 17:47:00

%S 1,9,89,639,4655,30330,198148,1233743,7694099,46938514,287070944,

%T 1738940782,10570927022,64059763010,389873574058,2373799261605,

%U 14522526860316,89060416668016,548932942208392,3395326330414774,21109553761623110,131785019270029876

%N Number of self-inverse permutations in S_n with longest increasing subsequence of length 9.

%C Also the number of Young tableaux with n cells and 9 rows.

%H Alois P. Heinz, <a href="/A217321/b217321.txt">Table of n, a(n) for n = 9..350</a>

%F a(n) = A182172(n,9)-A182172(n,8) = A212915(n)-A007580(n).

%Y Column k=9 of A047884.

%Y Cf. A007580, A182172, A212915.

%K nonn

%O 9,2

%A _Alois P. Heinz_, Sep 30 2012