This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 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
 1, 10, 109, 857, 6798, 48007, 338529, 2267425, 15164662, 98964444, 645978814, 4168541022, 26949303558, 173445855265, 1119737108943, 7224864497439, 46800745943134, 303692912870933, 1979556048016406, 12943419575576650, 85040314513698164, 560910092712436079 (list; graph; refs; listen; history; text; internal format)
 OFFSET 10,2 COMMENTS Also the number of Young tableaux with n cells and 10 rows. LINKS Alois P. Heinz, Table of n, a(n) for n = 10..350 FORMULA a(n) = A182172(n,10)-A182172(n,9) = A212916(n)-A212915(n). CROSSREFS Column k=10 of A047884. Cf. A182172, A212915, A212916. Sequence in context: A031419 A024527 A291894 * A198700 A320094 A267280 Adjacent sequences:  A217319 A217320 A217321 * A217323 A217324 A217325 KEYWORD nonn AUTHOR Alois P. Heinz, Sep 30 2012 STATUS approved

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

Last modified December 12 13:52 EST 2018. Contains 318063 sequences. (Running on oeis4.)