|
Search: id:A130221
|
|
|
| A130221 |
|
Number of partitions of n-set in which number of blocks of size 2k is odd (or zero) for every k. |
|
+0
1
|
|
| 1, 1, 2, 5, 12, 37, 158, 667, 2740, 13461, 74710, 412095, 2406880, 15450541, 103187698, 715323395, 5236160612, 40014337437, 318488475658, 2637143123027, 22603231117364, 201268520010153, 1855401760331982, 17624602999352535
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
E.g.f.: exp(sinh(x))*Product_{k>0} (1+sinh(x^(2*k)/(2*k)!)).
|
|
EXAMPLE
|
a(4)=12 because from the 15 (=A000110(4)) partitions of the 4-set {a,b,c,d} only the partitions ab|cd, ac|bd and ad|bc do not qualify.
|
|
MAPLE
|
g:=exp(sinh(x))*(product(1+sinh(x^(2*k)/factorial(2*k)), k=1..25)): gser:= series(g, x=0, 30): seq(factorial(n)*coeff(gser, x, n), n=0..23); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 28 2007
|
|
CROSSREFS
|
Cf. A000110, A102759.
Sequence in context: A003724 A138314 A115277 this_sequence A036782 A050237 A050258
Adjacent sequences: A130218 A130219 A130220 this_sequence A130222 A130223 A130224
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 05 2007, Aug 05 2007
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 28 2007
|
|
|
Search completed in 0.002 seconds
|
