login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A217322 Number of self-inverse permutations in S_n with longest increasing subsequence of length 10. 2

%I #6 Oct 14 2012 17:39:20

%S 1,10,109,857,6798,48007,338529,2267425,15164662,98964444,645978814,

%T 4168541022,26949303558,173445855265,1119737108943,7224864497439,

%U 46800745943134,303692912870933,1979556048016406,12943419575576650,85040314513698164,560910092712436079

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

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

%H Alois P. Heinz, <a href="/A217322/b217322.txt">Table of n, a(n) for n = 10..350</a>

%F a(n) = A182172(n,10)-A182172(n,9) = A212916(n)-A212915(n).

%Y Column k=10 of A047884.

%Y Cf. A182172, A212915, A212916.

%K nonn

%O 10,2

%A _Alois P. Heinz_, Sep 30 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)