|
|
A317829
|
|
Number of set partitions of multiset {1, 2, 2, 3, 3, 3, ..., n X n}.
|
|
21
|
|
|
1, 1, 4, 52, 2776, 695541, 927908528, 7303437156115, 371421772559819369, 132348505150329265211927, 355539706668772869353964510735, 7698296698535929906799439134946965681, 1428662247641961794158621629098030994429958386, 2405509035205023556420199819453960482395657232596725626
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Number of factorizations of the superprimorial A006939(n) into factors > 1. - Gus Wiseman, Aug 21 2020
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n = 2 we have a multiset {1, 2, 2} which can be partitioned as {{1}, {2}, {2}} or {{1, 2}, {2}} or {{1}, {2, 2}} or {{1, 2, 2}}, thus a(2) = 4.
|
|
MAPLE
|
g:= proc(n, k) option remember; uses numtheory; `if`(n>k, 0, 1)+
`if`(isprime(n), 0, add(`if`(d>k or max(factorset(n/d))>d, 0,
g(n/d, d)), d=divisors(n) minus {1, n}))
end:
a:= n-> g(mul(ithprime(i)^i, i=1..n)$2):
|
|
MATHEMATICA
|
chern[n_]:=Product[Prime[i]^(n-i+1), {i, n}];
facs[n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[facs[n/d], Min@@#>=d&]], {d, Rest[Divisors[n]]}]];
Table[Length[facs[chern[n]]], {n, 3}] (* Gus Wiseman, Aug 21 2020 *)
|
|
PROG
|
a(n) = {if(n==0, 1, count(vector(n, i, i)))} \\ Andrew Howroyd, Aug 31 2020
|
|
CROSSREFS
|
A000142 counts submultisets of the same multiset.
A022915 counts permutations of the same multiset.
A006939 lists superprimorials or Chernoff numbers.
A076716 counts factorizations of factorials.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|