login
A394995
a(n) is the number of permutations of length n that contain no 2-cycles and no 3-cycles.
0
1, 1, 1, 1, 7, 55, 355, 2275, 17185, 154945, 1573705, 17399305, 208494055, 2706158455, 37876273435, 568257965275, 9093172113025, 154584490885825, 2782472105638225, 52866640169167825, 1057333536041357575, 22204029371144195575, 488488769311296829075, 11235240803157765469075
OFFSET
0,5
REFERENCES
Miklos Bona, Introduction to Enumerative and Analytic Combinatorics, CRC Press, 2025, p. 412.
LINKS
FORMULA
E.g.f.: exp(-x^2/2-x^3/3)/(1 - x).
a(n) ~ A394996*n!.
MAPLE
a:= proc(n) option remember; `if`(n=0, 1, add(
a(n-j)*(j-1)!*binomial(n-1, j-1), j=[1, $4..n]))
end:
seq(a(n), n=0..23); # Alois P. Heinz, Apr 10 2026
MATHEMATICA
terms=24; CoefficientList[Series[Exp[-x^2/2-x^3/3]/(1-x), {x, 0, terms-1}], x]*Range[0, terms-1]!
CROSSREFS
Cf. A000142, A038205, A047865 (inverse binomial transform), A394996.
Sequence in context: A121183 A291891 A217327 * A069404 A198689 A320091
KEYWORD
nonn,new
AUTHOR
Stefano Spezia, Apr 09 2026
STATUS
approved