OFFSET
0,3
COMMENTS
Each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.
a(n) mod 2 = A133872(n).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..450
Wikipedia, Permutation
MAPLE
b:= proc(n, i) option remember; `if`(n=0, 1, add(
(j-1)!*b(n-j, j)*binomial(n-1, j-1), j=i..n))
end:
a:= n-> b(n, 1):
seq(a(n), n=0..30);
MATHEMATICA
b[n_, i_] := b[n, i] = If[n == 0, 1, Sum[(j - 1)!*b[n - j, j]*Binomial[n - 1, j - 1], {j, i, n}]];
a[n_] := b[n, 1];
Table[a[n], {n, 0, 30}] (* Jean-François Alcover, May 25 2018, translated from Maple *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, May 01 2017
STATUS
approved