|
|
A104708
|
|
Product of number of involutions on n letters and number of partitions of n
|
|
1
|
|
|
1, 1, 4, 12, 50, 182, 836, 3480, 16808, 78600, 398832, 1998976, 10791704, 57418904, 322714800, 1821518336, 10673756016, 62904395664, 383965822240, 2356753705600, 14896682388192, 95002532773632, 620122408189824
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
so
a(3)=4*3=12 because there are 4 involutions of 123 (namely: 123, 132, 213 and 321) and 3 partitions of 3 (3=2+1=1+1+1).
|
|
MAPLE
|
with(combinat): b:= proc(n) option remember: if n=0 then 1 elif n=1 then 1 else b(n-1)+(n-1)*b(n-2): fi: end: c:=n->numbpart(n): seq(b(n)*c(n), n=0..25);
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|