|
Search: id:A102232
|
|
|
| A102232 |
|
Number of preferential arrangements of n labeled elements when at least k=three ranks are required. |
|
+0 2
|
|
| 0, 0, 0, 6, 60, 510, 4620, 47166, 545580, 7086750, 102246540, 1622630526, 28091563500, 526858340190, 10641342954060, 230283190945086, 5315654681915820, 130370767029004830, 3385534663256583180
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
The labeled case for k=2 is given by A052875. The unlabeled case for k=3 is given by A000295 = Eulerian numbers 2^n - n - 1. The unlabeled case for k=2 is given by A000225 = 2^n - 1.
|
|
LINKS
|
Thomas Wieder, Home Page.
Thomas Wieder, (Old) Home Page.
|
|
FORMULA
|
G.f.: -(exp(z)^3-3*exp(z)^2+3*exp(z)-1)/(-2+exp(z)).
|
|
EXAMPLE
|
Let 1,2,3 denote three labeled elements. Let | denote a separation between two ranks. E.g. if element 1 is on rank (also called level) one, element 3 is on rank two, and element 2 is on rank three, then we have the ranking 1|3|2.
For n=3 we have obviously a(3)=6 possible rankings:
2|3|1, 3|2|1, 1|2|3, 2|1|3, 3|1|2, 1|3|2.
For n=4 we have a(4) = 60 possible rankings, e.g. (elements 1 and 3 are on the same rank in the first two examples)
31|2|4, 2|4|31, 4|1|3|2.
|
|
MAPLE
|
series(-(exp(z)^3-3*exp(z)^2+3*exp(z)-1)/(-2+exp(z)), z=0, 30);
|
|
CROSSREFS
|
Cf. A000670, A025875, A000295.
Adjacent sequences: A102229 A102230 A102231 this_sequence A102233 A102234 A102235
Sequence in context: A076100 A043033 A061495 this_sequence A121113 A091710 A054880
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Thomas Wieder (wieder.thomas(AT)t-online.de), Jan 01 2005
|
|
|
Search completed in 0.002 seconds
|