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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007537 Number of proper covers of an n-set.
(Formerly M5287)
6
0, 1, 45, 15913, 1073579193, 4611686005542975085, 85070591730234615801280047645054636261, 28948022309329048855892746252171976961956366698726387156269151989162886489297 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

REFERENCES

A. J. Macula, Covers of a finite set, Math. Mag., 67 (1994), 141-144.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

MAPLE

A007537 := proc(n) 1/2*sum((-1)^k*binomial(n, k)*2^(2^(n-k)), k=0..n)-2^(2^n)/4 end;

MATHEMATICA

Table[1/2 Sum[(-1)^k Binomial[n, k]2^(2^(n-k)), {k, 0, n}]-2^2^n/4, {n, 8}] (* From Harvey P. Dale, Oct 31 2011 *)

CROSSREFS

Cf. A003465.

Sequence in context: A201004 A171118 A199521 * A125113 A003739 A145319

Adjacent sequences:  A007534 A007535 A007536 * A007538 A007539 A007540

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)

EXTENSIONS

One more term from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 01 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 17 14:50 EST 2012. Contains 206050 sequences.