# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a059119 Showing 1-1 of 1 %I A059119 #13 Sep 17 2019 11:36:06 %S A059119 1,1,1,2,1,4,1,1,8,9,2,1,16,55,64,25,6,1,1,32,285,1090,2020,2146,1380, %T A059119 490,115,20,2,1,64,1351,14000,82115,304752,759457,1308270,1613250, %U A059119 1484230,1067771,635044,326990,147440,57675,19238,5325,1170,190,20,1,1 %N A059119 Triangle a(n,m)=number of m-element antichains on a labeled n-set; number of monotone n-variable Boolean functions with m mincuts (lower units), m=0..binomial(n,floor(n,2)). %C A059119 Row sums give A000372. %D A059119 V. Jovovic, G. Kilibarda, On enumeration of the class of all monotone Boolean functions, in preparation. %H A059119 Suresh Govindarajan and Deepak Aditya, Table of n, a(n) for n = 0..94 %H A059119 K. S. Brown, Dedekind's Problem %H A059119 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). %F A059119 a(n, 0) = 1; a(n, 1) = 2^n; a(n, 2) = A016269(n); a(n, 3) = A047707(n); a(n, 4) = A051112(n); a(5, n) = A051113(n); a(6, n) = A051114(n); a(7, n) = A051115(n); a(8, n) = A051116(n); a(9, n) = A051117(n); a(10, n) = A051118(n). %e A059119 [1, 1], %e A059119 [1, 2], %e A059119 [1, 4, 1], %e A059119 [1, 8, 9, 2], %e A059119 [1, 16, 55, 64, 25, 6, 1], %e A059119 [1, 32, 285, 1090, 2020, 2146, 1380, 490, 115, 20, 2], ... %Y A059119 Cf. A000372, A016269, A047707, A051112-A051118. %K A059119 nonn,tabf %O A059119 0,4 %A A059119 _Vladeta Jovovic_, Goran Kilibarda, Jan 06 2001 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE