

A351781


a(n) = (n1)^n*(n1)!^n.


0



0, 1, 64, 104976, 8153726976, 46656000000000000, 28079296819683655680000000, 2400095991902688012207233433600000000, 37800243186554601452585666030525214621696000000000
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

a(n) is the number of women's ranking tables in the stable marriage problem that can be paired with a men's ranking table having no two men with the same first choice, without forming any mutual first choices. It has two terms: (n1)^n from A065440(n), and (n1)!^n from A091868(n1). Such men's ranking tables having no two men with the same first choice arise in A343694, A343475, and A344663.
a(n)*A123234 is a useful alternative to A343696 which combines a Latin men's ranking table with an arbitrary women's table, since it gives fewer instances to consider.


LINKS



FORMULA

a(n) = (n1)^n*(n1)!^n.


MATHEMATICA

Table[(n1)^n*(n1)!^n, {n, 1, 9}]


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



