|
| |
|
|
A111169
|
|
Number of top simplices in a minimal triangulation of the permutohedron.
|
|
0
| |
|
|
1, 1, 4, 34, 488, 10512, 316224, 12649104, 649094752, 41568338240, 3249938294656, 304670810708736, 33736950933298688, 4356802177994094080, 649031480783423250432, 110477935456564190447616
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| The analogous sequence with associahedron in place of permutohedron is (n+1)^{n-1}.
|
|
|
REFERENCES
| J.-L. Loday, Parking functions and triangulation of the associahedron, ArXiv math:AT/0510380
|
|
|
LINKS
| J.-L. Loday, More information
|
|
|
FORMULA
| a(n) = sum_{m=0..n-1} (binom(n+1, m+1) -1) binom(n-1, m) a(m) a(n-m-1). - Robert G. Wilson v (rgwv(at)rgwv.com), Oct 31 2005
|
|
|
MAPLE
| function y=binom(n, p); y=1; for j = 0 : p-1; y=y*(n-j); end; for j = 1 : p; y=y/j; end; format long; nmax = 14; mm=nmax+1; zp=zeros(mm, 1); zp(1:1) = 1; for n = 1 : nmax; z=0; for p = 0 : n-1; z=z+ (binom(n+1, p+1)-1) * binom(n-1, p) * zp(p+1:p+1) * zp(n-p:n-p); end; zp(n+1:n+1)=z; z; end; n, z
|
|
|
MATHEMATICA
| f[0] = 1; f[n_] := Sum[(Binomial[n + 1, m + 1] - 1)Binomial[n - 1, m]f[m]f[n - m - 1], {m, 0, n - 1}]; Table[f[n], {n, 0, 16}] (* Robert G. Wilson v *)
|
|
|
CROSSREFS
| Sequence in context: A193099 A198976 A156325 * A002105 A198717 A198908
Adjacent sequences: A111166 A111167 A111168 * A111170 A111171 A111172
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jean-Louis Loday (loday(AT)math.u-strasbg.fr), Oct 21 2005
|
|
|
EXTENSIONS
| More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 31 2005
|
| |
|
|
