login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032310 Number of ways to partition n labeled elements into sets of odd sizes, with all sizes different. 1
1, 0, 1, 4, 1, 6, 1, 64, 505, 130, 1321, 1024, 13157, 2380, 395851, 5782144, 1639617, 24545706, 16100905, 306621184, 292018525, 6304002100, 1549052715, 507969498304, 11794047630801, 3164830777316 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

LINKS

C. G. Bower, Transforms (2)

FORMULA

"EGJ" (unordered, element, labeled) transform of 1, 0, 1, 0... (odds)

E.g.f.: Product_{k>0} (1+x^(2*k-1)/(2*k-1)!). - Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 16 2004

CROSSREFS

Cf. A003724.

Sequence in context: A197008 A087652 A072195 * A032220 A032145 A032050

Adjacent sequences:  A032307 A032308 A032309 * A032311 A032312 A032313

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net)

EXTENSIONS

Description corrected by Vladeta Jovovic, Aug 18 2004.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 12:41 EST 2012. Contains 205909 sequences.