OFFSET
0,2
COMMENTS
Number of ways to choose one element from each block of the partitions of a 2n-set into even blocks (see example). - Enrique Navarrete, Sep 03 2025
FORMULA
a(0) = 1; a(n) = 2 * Sum_{k=1..n} binomial(2*n-1,2*k-1) * k * a(n-k). - Ilya Gutkovskiy, Mar 10 2022
EXAMPLE
From Enrique Navarrete, Sep 03 2025: (Start)
Seen as even groups of a total of 2*n people, the number of ways to choose one person from each group (block) for n=4 is (number of people in parentheses):
1 group (8): 1 such group, 8 ways;
2 groups (6,2): 28 such groups, 336 ways;
2 groups (4,4): 35 such groups, 560 ways;
3 groups (4,2,2): 210 such groups, 3360 ways;
4 groups (2,2,2,2): 105 such groups, 1680 ways, for a total of 5944 ways. (End)
MAPLE
b:= proc(n) option remember; `if`(n=0, 1, add(
b(n-2*j)*binomial(n-1, 2*j-1)*2*j, j=1..n/2))
end:
a:= n-> b(2*n):
seq(a(n), n=0..16); # Alois P. Heinz, Sep 08 2025
MATHEMATICA
With[{nn=30}, Take[CoefficientList[Series[Exp[Sinh[x]*x], {x, 0, nn}], x] Range[0, nn]!, {1, -1, 2}]] (* Harvey P. Dale, Jul 31 2020 *)
PROG
(PARI) my(x='x+O('x^40), v=Vec(serlaplace(exp(sinh(x)*x)))); vector(#v\2, k, v[2*k-1]) \\ Michel Marcus, Mar 10 2022
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Extended and signs tested by Olivier Gérard, Mar 15 1997
Previous Mathematica program replaced by Harvey P. Dale, Jul 31 2020
STATUS
approved
