Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108459
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108459 Number of labeled partitions of (n,n) into pairs (i,j). +0
4
1, 1, 5, 52, 855, 19921, 614866, 24040451, 1152972925, 66200911138, 4465023867757, 348383154017581, 31052765897026352, 3128792250765898965, 353179564583216567917, 44320731930172534543092 (list; graph; listen)
OFFSET

0,3

COMMENT

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.yu), Aug 31 2006

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

CROSSREFS

Main diagonal of A108458. Cf. A108461.

Sequence in context: A134111 A071583 A099881 this_sequence A076281 A099977 A001173

Adjacent sequences: A108456 A108457 A108458 this_sequence A108460 A108461 A108462

KEYWORD

nonn

AUTHOR

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

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research