|
|
A036081
|
|
The number of partitions of {1..(11n)} that are invariant under a permutation consisting of n 11-cycles.
|
|
2
|
|
|
1, 2, 16, 202, 3044, 52794, 1055260, 24081754, 615896308, 17347970202, 531721375308, 17595339114554, 624882463734756, 23691503493287738, 954301756159098172, 40665568780962213530, 1826521141853468785364
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Original name: Sorting numbers.
|
|
LINKS
|
|
|
FORMULA
|
E.g.f.: exp((exp(p*x)-p-1)/p+exp(x)) for p=11.
a(n) ~ exp(exp(p*r)/p + exp(r) - 1 - 1/p - n) * (n/r)^(n + 1/2) / sqrt((1 + p*r)*exp(p*r) + (1 + r)*exp(r)), where r = LambertW(p*n)/p - 1/(1 + p/LambertW(p*n) + n^(1 - 1/p) * (1 + LambertW(p*n)) * (p/LambertW(p*n))^(2 - 1/p)) for p=11. - Vaclav Kotesovec, Jul 03 2022
a(n) ~ (11*n/LambertW(11*n))^n * exp(n/LambertW(11*n) + (11*n/LambertW(11*n))^(1/11) - n - 12/11) / sqrt(1 + LambertW(11*n)). - Vaclav Kotesovec, Jul 10 2022
|
|
MATHEMATICA
|
u[0, j_] := 1; u[k_, j_] := u[k, j] = Sum[Binomial[k-1, i-1]Plus@@(u[k-i, j]#^(i-1)&/@Divisors[j]), {i, k}]; Table[u[n, 11], {n, 0, 30}] (* Vincenzo Librandi, Dec 12 2012 - after Wouter Meeussen in similar sequences *)
mx = 16; p = 11; Range[0, mx]! CoefficientList[ Series[ Exp[ (Exp[p*x] - p - 1)/p + Exp[x]], {x, 0, mx}], x] (* Robert G. Wilson v, Dec 12 2012 *)
Table[Sum[Binomial[n, k] * 11^k * BellB[k, 1/11] * BellB[n-k], {k, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, Jun 29 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|