|
|
A121860
|
|
a(n) = Sum_{d|n} n!/(d!*(n/d)!).
|
|
18
|
|
|
1, 2, 2, 8, 2, 122, 2, 1682, 10082, 30242, 2, 7318082, 2, 17297282, 3632428802, 36843206402, 2, 2981705126402, 2, 1690185726028802, 3379030566912002, 28158588057602, 2, 76941821303636889602, 1077167364120207360002
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
a(n) = 2 for prime n. It appears that all terms belong to A100195 (Numbers n such that the denominator of BernoulliB[n] is a record). - Alexander Adamchuk, Sep 09 2006
a(n) = 2 iff n is prime.
Number of matrices whose entries are 1,...,n, up to row and column permutations. For example, inequivalent representatives of the a(4) = 8 matrices are:
[1 2 3 4]
.
[1 2] [1 2] [1 3] [1 3] [1 4] [1 4]
[3 4] [4 3] [2 4] [4 2] [2 3] [3 2]
.
[1]
[2]
[3]
[4]
(End)
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: Sum_{k>0} (exp(x^k)-1)/k!.
|
|
MATHEMATICA
|
f[n_] := Block[{d = Divisors@n}, Plus @@ (n!/(d! (n/d)!))]; Array[f, 25] (* Robert G. Wilson v, Sep 11 2006 *)
|
|
PROG
|
(PARI) a(n) = sumdiv(n, d, n!/(d!*(n/d)!)); \\ Michel Marcus, Sep 13 2018
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|