OFFSET
0,3
COMMENTS
Number of partitions of n-set into "lists", in which every even list appears an odd number of times, cf. A000262. - Alois P. Heinz, May 10 2016
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..450
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 507
FORMULA
E.g.f.: (-1+x^4-x^3)/(-1+x).
Recurrence: {a(1)=1, a(0)=1, (-1-n)*a(n)+a(n+1)=0, a(2)=2, a(4)=24, a(3)=12}.
a(n) = n! for n>3.
MAPLE
spec := [S, {S=Union(Sequence(Z), Prod(Z, Z, Z))}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
# second Maple program:
with(combinat):
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
add(`if`(i::even and j::even, 0, b(n-i*j, i-1)*
multinomial(n, n-i*j, i$j)/j!*i!^j), j=0..n/i)))
end:
a:= n-> b(n$2):
seq(a(n), n=0..25); # Alois P. Heinz, May 10 2016
MATHEMATICA
a[n_] := If[n <= 3, {1, 1, 2, 12}[[n+1]], n!];
a /@ Range[0, 25] (* Jean-François Alcover, Nov 10 2020 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
STATUS
approved