Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056047
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056047 Number of 4-antichain covers of a labeled n-set. +0
2
0, 0, 0, 0, 25, 1895, 70370, 1868650, 41062035, 802349205, 14514339340, 249104207000, 4120588431245, 66392465654515, 1049608974433110, 16365222591176550 (list; graph; listen)
OFFSET

0,5

REFERENCES

V. Jovovic and G. Kilibarda, On the number of Boolean functions in the Post classes F^{mu}_8, Diskretnaya Matematika, 11 (1999), no. 4, 127-138 (translated in Discrete Mathematics and Applications, 9, (1999), no. 6)

V. Jovovic, G. Kilibarda, On enumeration of the class of all monotone Boolean functions, in preparation.

LINKS

K. S. Brown, Dedekind's problem

Eric Weisstein's World of Mathematics, Antichain covers"

FORMULA

a(n)=(1/4!)*(15^n - 12*11^n + 24*9^n + 4*8^n - 18*7^n + 6*6^n - 36*5^n + 36*4^n + 11*3^n - 22*2^n + 6).

CROSSREFS

Cf. A051112.

Sequence in context: A125826 A033981 A023113 this_sequence A051112 A061843 A135057

Adjacent sequences: A056044 A056045 A056046 this_sequence A056048 A056049 A056050

KEYWORD

nonn

AUTHOR

Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu), Jul 25 2000

page 1

Search completed in 0.004 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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research