Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054780
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054780 Number of n-covers of a labeled n-set. +0
3
1, 1, 3, 32, 1225, 155106, 63602770, 85538516963, 386246934638991, 6001601072676524540, 327951891446717800997416, 64149416776011080449232990868, 45546527789182522411309599498741023 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=sum_{k=0..n} (-1)^k*C(n, k)*C(2^(n-k)-1, n).

Also a(n) = (1/n!)*sum_{k=0..n} Stirling1(n+1, k+1)*(2^k-1)^n.

G.f.: Sum_{n>=0} ln(1+(2^n-1)*x)^n/((1+(2^n-1)*x)*n!). - Paul Hanna and Vladeta Jovovic (vladeta(AT)eunet.rs), Jan 16 2008

CROSSREFS

Cf. A048291.

Main diagonal of A055154.

Sequence in context: A123336 A058479 A129431 this_sequence A134474 A096469 A106423

Adjacent sequences: A054777 A054778 A054779 this_sequence A054781 A054782 A054783

KEYWORD

easy,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs), May 21 2000

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research