A059090 - OEIS

A059090

Triangle T(n,m) giving number of m-element intersecting antichains on a labeled n-set or n-variable Boolean functions with m nonzero values in the Post class F(7,2), m=0,.., A037952(n).

1, 1, 1, 1, 3, 1, 7, 3, 1, 1, 15, 30, 30, 5, 1, 31, 195, 605, 780, 543, 300, 135, 45, 10, 1, 1, 63, 1050, 9030, 41545, 118629, 233821, 329205, 327915, 224280, 100716, 29337, 5950, 910, 105, 7

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,5

COMMENTS

An antichain is called intersecting (or proper) antichain if every two members have a nonempty intersection. Row sums give the number of intersecting antichains on a labeled n-set or n-variable Boolean functions in the Post class F(7,2) or self-dual monotone Boolean functions of n+1 variables. Cf. A001206.

REFERENCES

Jovovic V., Kilibarda G., The number of n-variable Boolean functions in the Post class F(7,2), Belgrade, 2001, in preparation.

Pogosyan G., Miyakawa M., Nozaki A., Rosenberg I., The Number of Clique Boolean Functions, IEICE Trans. Fundamentals, Vol. E80-A, No. 8, pp. 1502-1507, 1997/8.

LINKS

Table of n, a(n) for n=0..40.

Index entries for sequences related to Boolean functions

Pogosyan et al., The Number of Clique Boolean Functions

FORMULA

T(n, 0)=1, T(n, 1)=2^n-1, T(n, 2)=A032263(n), T(n, 3)=A051303(n), T(n, 4)=A051304(n), T(n, 5)=A051305(n), T(n, 6)=A051306(n), T(n, 7)=A051307(n).

EXAMPLE

1, 1;

1, 3;

1, 7, 3, 1;

1, 15, 30, 30, 5;

1, 31, 195, 605, 780, 543, 300, 135, 45, 10, 1;