|
Search: id:A054652
|
|
|
| A054652 |
|
Acyclic orientations of the Hamming graph (K_2) x (K_n). |
|
+0
2
|
|
| 1, 2, 14, 204, 5016, 185520, 9595440, 659846880, 58130513280, 6376568728320, 851542303852800, 135930981520857600, 25547289000870067200, 5581430113409537587200, 1402137089367777207244800
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This number is equivalent to the number of plans (i.e. structural solutions) of the open shop problem with n jobs and 2 machines - see problems in scheduling theory.
|
|
REFERENCES
|
H. Braesel, M. Kleinau, On the number of feasible schedules of the open shop problem - an application of special Latin rectangles, Optimization 23 (1992) 251-260
M. Harborth, Structural analysis of shop scheduling problems, PhD thesis, Otto-von-Guericke-Univ. Magdeburg, GCA-Verlag, 1999 (in German)
|
|
LINKS
|
Structural analysis of shop scheduling problems (PhD thesis in German with English abstract)
|
|
FORMULA
|
n!*Sum[n!/k!*binomial[n, k], {k, 0, n}]
|
|
MATHEMATICA
|
Table[n!*Sum[n!/k!*Binomial[n, k], {k, 0, n}], {n, 0, 20}]
|
|
CROSSREFS
|
A002720*n! Cf. A054653, A053870, A054583.
Sequence in context: A090300 A102224 A123543 this_sequence A122647 A136550 A068369
Adjacent sequences: A054649 A054650 A054651 this_sequence A054653 A054654 A054655
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
M. Harborth (Martin.Harborth(AT)vt.siemens.de)
|
|
|
Search completed in 0.002 seconds
|
