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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108459 Number of labeled partitions of (n,n) into pairs (i,j). 5
1, 1, 5, 52, 855, 19921, 614866, 24040451, 1152972925, 66200911138, 4465023867757, 348383154017581, 31052765897026352, 3128792250765898965, 353179564583216567917, 44320731930172534543092 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Partitions of n black objects labeled 1..n and n white objects labeled 1..n. Each partition must have at least one white object.

FORMULA

a(n) = Sum_{k=0..n} k^n*Stirling2(n,k). - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 31 2006

E.g.f.: Sum_{n>=0} (exp(n*x)-1)^n/n!. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 12 2007

CROSSREFS

Main diagonal of A108458. Cf. A108461.

Sequence in context: A071583 A099881 A196531 * A076281 A099977 A001173

Adjacent sequences:  A108456 A108457 A108458 * A108460 A108461 A108462

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jun 03 2005

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 03:44 EST 2012. Contains 205860 sequences.