Search: a001458 -id:a001458
|
|
A047874
|
|
Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n).
|
|
+10
25
|
|
|
1, 1, 1, 1, 4, 1, 1, 13, 9, 1, 1, 41, 61, 16, 1, 1, 131, 381, 181, 25, 1, 1, 428, 2332, 1821, 421, 36, 1, 1, 1429, 14337, 17557, 6105, 841, 49, 1, 1, 4861, 89497, 167449, 83029, 16465, 1513, 64, 1, 1, 16795, 569794, 1604098, 1100902, 296326, 38281, 2521, 81, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
Mirror image of triangle in A126065.
T(n,m) is also the sum of squares of n!/(product of hook lengths), summed over the partitions of n in exactly m parts (Robinson-Schensted correspondence). - Wouter Meeussen, Sep 16 2010
Table I "Distribution of L_n" on p. 98 of the Pilpel reference. - Joerg Arndt, Apr 13 2013
In general, for column k 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)) (result due to Regev) . - Vaclav Kotesovec, Mar 18 2014
|
|
LINKS
|
J. M. Hammersley, A few seedings of research, in Proc. Sixth Berkeley Sympos. Math. Stat. and Prob., ed. L. M. le Cam et al., Univ. Calif. Press, 1972, Vol. I, pp. 345-394.
|
|
FORMULA
|
|
|
EXAMPLE
|
T(3,2) = 4 because 132, 213, 231, 312 have longest increasing subsequences of length 2.
Triangle T(n,k) begins:
1;
1, 1;
1, 4, 1;
1, 13, 9, 1;
1, 41, 61, 16, 1;
1, 131, 381, 181, 25, 1;
1, 428, 2332, 1821, 421, 36, 1;
...
|
|
MAPLE
|
h:= proc(l) local n; n:= nops(l); add(i, i=l)! /mul(mul(1+l[i]-j
+add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n) end:
g:= (n, i, l)-> `if`(n=0 or i=1, h([l[], 1$n])^2, `if`(i<1, 0,
add(g(n-i*j, i-1, [l[], i$j]), j=0..n/i))):
T:= n-> seq(g(n-k, min(n-k, k), [k]), k=1..n):
|
|
MATHEMATICA
|
Table[Total[NumberOfTableaux[#]^2&/@ IntegerPartitions[n, {k}]], {n, 7}, {k, n}] (* Wouter Meeussen, Sep 16 2010, revised Nov 19 2013 *)
h[l_List] := Module[{n = Length[l]}, Total[l]!/Product[Product[1+l[[i]]-j+Sum[If[l[[k]] >= j, 1, 0], {k, i+1, n}], {j, 1, l[[i]]}], {i, 1, n}]]; g[n_, i_, l_List] := If[n == 0 || i == 1, h[Join[l, Array[1&, n]]]^2, If[i<1, 0, Sum[g[n-i*j, i-1, Join[l, Array[i&, j]]], {j, 0, n/i}]]]; T[n_] := Table[g[n-k, Min[n-k, k], {k}], {k, 1, n}]; Table[T[n], {n, 1, 12}] // Flatten (* Jean-François Alcover, Mar 06 2014, after Alois P. Heinz *)
|
|
CROSSREFS
|
Cf. A224652 (Table II "Distribution of F_n" on p. 99 of the Pilpel reference).
|
|
KEYWORD
|
|
|
AUTHOR
|
Eric Rains (rains(AT)caltech.edu)
|
|
STATUS
|
approved
|
|
|
|
|
A239432
|
|
Number of permutations of length n with longest increasing subsequence of length 8.
|
|
+10
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
|
|
|
FORMULA
|
a(n) ~ 1913625 * 2^(6*n+77) / (Pi^(7/2) * n^(63/2)).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.012 seconds
|