This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A239432 Number of permutations of length n with longest increasing subsequence of length 8. 2
 1, 64, 2521, 79861, 2250887, 59367101, 1508071384, 37558353900, 927716186325, 22904111472825, 568209449266202, 14216730315766814, 359666061054003144, 9216708503647774264, 239524408949706575548, 6317740398995612513164, 169207499997274346326579, 4602911809939402715164066 (list; graph; refs; listen; history; text; internal format)
 OFFSET 8,2 COMMENTS In general, for column k of A047874 is a(n) ~ product(j!, j=0..k-1) * k^(2*n+k^2/2) / (2^((k-1)*(k+2)/2) * Pi^((k-1)/2) * n^((k^2-1)/2)) [Regev, 1981]. LINKS Vaclav Kotesovec, Table of n, a(n) for n = 8..135 A. Regev, Asymptotic values for degrees associated with strips of Young diagrams, Adv. in Math. 41 (1981), 115-136. FORMULA a(n) ~ 1913625 * 2^(6*n+77) / (Pi^(7/2) * n^(63/2)). CROSSREFS Cf. A047874, A001453, A001454, A001455, A001456, A001457, A001458. Sequence in context: A053107 A000812 A240363 * A004388 A269291 A203256 Adjacent sequences:  A239429 A239430 A239431 * A239433 A239434 A239435 KEYWORD nonn AUTHOR Vaclav Kotesovec, Mar 18 2014 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 September 17 10:52 EDT 2019. Contains 327129 sequences. (Running on oeis4.)