Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096579
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096579 Number of partitions of an n-set with exactly one even block. +0
9
0, 1, 3, 7, 25, 91, 329, 1415, 6297, 29431, 151085, 802099, 4506957, 26836083, 165586321, 1074740079, 7268876881, 50985776815, 372854157589, 2820244541675, 22087612114805, 179014336044171, 1495539626297689, 12894921568568999 (list; graph; listen)
OFFSET

1,3

FORMULA

E.g.f.: exp(sinh(x))*(cosh(x)-1). More generally, e.g.f. for the number of partitions of n-set with exactly k even blocks is 1/k!*exp(sinh(x))*(cosh(x)-1)^k.

MATHEMATICA

Drop[ Range[0, 24]! CoefficientList[ Series[ E^Sinh[x]*(Cosh[x] - 1), {x, 0, 24}], x], 1] (from Robert G. Wilson v Aug 17 2004)

CROSSREFS

Cf. A003724.

Sequence in context: A148739 A129084 A002870 this_sequence A120540 A133206 A054092

Adjacent sequences: A096576 A096577 A096578 this_sequence A096580 A096581 A096582

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 13 2004

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 17 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research