|
Search: id:A130220
|
|
|
| A130220 |
|
Number of partitions of n-set in which number of blocks of size k is odd (or zero) for every k. |
|
+0
3
|
|
| 1, 1, 1, 5, 5, 27, 117, 331, 1213, 6579, 47193, 140527, 1213841, 4617927, 48210879, 243443739, 2392565149, 10377087115, 125434781845, 725455816883, 8086277450629, 59694530600595, 614469256831895, 4650128350629285
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
FORMULA
|
E.g.f.: Product_{k>0} (1+sinh(x^k/k!)).
|
|
EXAMPLE
|
a(4)=5 because we have abcd, a|bcd, acd|b, abd|c and abc|d.
|
|
MAPLE
|
g:=product(1+sinh(x^k/factorial(k)), k=1..30): gser:=series(g, x=0, 28): seq(factorial(n)*coeff(gser, x, n), n=0..24); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Sep 01 2007
|
|
CROSSREFS
|
Cf. A055922, A102759, A111723, A111724.
Sequence in context: A038247 A093643 A165423 this_sequence A081847 A020551 A153271
Adjacent sequences: A130217 A130218 A130219 this_sequence A130221 A130222 A130223
|
|
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
|
