[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A052809
A simple grammar: number of cycles of cycles.
3
0, 0, 2, 6, 28, 175, 1368, 12838, 140656, 1762794, 24878320, 390495336, 6748280064, 127324033824, 2604355096224, 57404425654080, 1356401049662208, 34202807058719568, 916723959720053760
OFFSET
0,3
LINKS
FORMULA
E.g.f.: log(-1/(-1+log(-1/(-1+x))))*x.
E.g.f.: -log(1+log(1-x))*x. - Vaclav Kotesovec, Oct 01 2013
a(n) ~ (n-1)! * (exp(1)/(exp(1)-1))^(n-1). - Vaclav Kotesovec, Oct 01 2013
a(n) = n * Sum_{k=1..n-1} (k-1)! * |Stirling1(n-1,k)| = n * A003713(n-1). - Seiichi Manyama, May 20 2022
MAPLE
spec := [S, {B=Cycle(C), C=Cycle(Z), S=Prod(B, Z)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
MATHEMATICA
CoefficientList[Series[-Log[1+Log[1-x]]*x, {x, 0, 20}], x]* Range[0, 20]! (* Vaclav Kotesovec, Oct 01 2013 *)
PROG
(PARI) a(n) = n*sum(k=1, n-1, (k-1)!*abs(stirling(n-1, k, 1))); \\ Seiichi Manyama, May 20 2022
CROSSREFS
Sequence in context: A207386 A088501 A140092 * A136631 A002435 A276911
KEYWORD
easy,nonn
AUTHOR
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
STATUS
approved