Maximum number of pairwise incomparable subcubes of the discrete n-cube. Largest antichain in partial ordering {0,1,*}^n where 0 and 1 are less than *. Maximum number of implicants in an irredundant disjunctive normal form for n Boolean variables.

A109388

Maximum number of pairwise incomparable subcubes of the discrete n-cube. Largest antichain in partial ordering {0,1,*}^n where 0 and 1 are less than *. Maximum number of implicants in an irredundant disjunctive normal form for n Boolean variables.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =12a(4) =32a(5) =80a(6) =240a(7) =672a(8) =1792a(9) =5376a(10) =15360a(11) =42240a(12) =126720a(13) =366080a(14) =1025024a(15) =3075072a(16) =8945664a(17) =25346048a(18) =76038144a(19) =222265344a(20) =635043840a(21) =1905131520a(22) =5588385792a(23) =16066609152a(24) =48199827456a(25) =141764198400a(26) =409541017600

External references