|
Search: id:A130219
|
|
|
| A130219 |
|
Number of partitions of 2n-set in which number of blocks of size k is even (or zero) for every k. |
|
+0
6
|
|
| 1, 1, 4, 56, 631, 15457, 582374, 18589286, 894499204, 51154344582, 3823359163826, 274722100927166, 25458967562911128, 2569179797929092506, 284554990016509385086
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
E.g.f.: Product_{k>0} cosh(x^k/k!).
|
|
EXAMPLE
|
a(2)=4 because we have ab|cd, ac|bd, ad|bc and a|b|c|d.
|
|
MAPLE
|
g:=product(cosh(x^k/factorial(k)), k=1..35): gser:=series(g, x=0, 32): seq(factorial(2*n)*coeff(gser, x, 2*n), n=0..14); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Sep 01 2007
|
|
CROSSREFS
|
Cf. A055922, A102759, A111723, A111724.
Sequence in context: A020540 A101540 A026740 this_sequence A111874 A078533 A009058
Adjacent sequences: A130216 A130217 A130218 this_sequence A130220 A130221 A130222
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 04 2007, Aug 05 2007
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Sep 01 2007
|
|
|
Search completed in 0.002 seconds
|
