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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047707 Number of monotone Boolean functions of n variables with 3 mincuts. Also Sperner systems with 3 blocks. 37
0, 0, 0, 2, 64, 1090, 14000, 153762, 1533504, 14356610, 128722000, 1119607522, 9528462944, 79817940930, 660876543600, 5424917141282, 44246078560384, 359144709794050, 2904688464582800, 23429048035827042, 188593339362097824 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 292, #8, s(n,3).

LINKS

K. S. Brown, Dedekind's problem.

Vladeta Jovovic, Illustration for A016269, A047707, A051112-A051118

Index entries for sequences related to Boolean functions

Goran Kilibarda and Vladeta Jovovic, Antichains of Multisets, J. Integer Seqs., Vol. 7, 2004.

FORMULA

(2^n)*(2^n - 1)*(2^n - 2)/6 - (6^n - 5^n - 4^n + 3^n).

CROSSREFS

Cf. A016269, A051112.

Sequence in context: A064010 A120829 A120121 * A134939 A122603 A127691

Adjacent sequences:  A047704 A047705 A047706 * A047708 A047709 A047710

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 15 12:25 EST 2012. Contains 205786 sequences.