Triangle read by rows: T(n,k) is the number of functions on the Boolean lattice B_n satisfying f({}) =0, f([n])=k, and the Boolean growth rule: f(J union {i})-f(J) in {0,1} for all subsets J of [n]={1, ..., n} and all i in [n]\J, 0 <= k <= n.
A374819
Triangle read by rows: T(n,k) is the number of functions on the Boolean lattice B_n satisfying f({}) =0, f([n])=k, and the Boolean growth rule: f(J union {i})-f(J) in {0,1} for all subsets J of [n]={1, ..., n} and all i in [n]\J, 0 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =18a(8) =18a(9) =1a(10) =1a(11) =166a(12) =656a(13) =166a(14) =1a(15) =1a(16) =7579a(17) =189967a(18) =189967a(19) =7579a(20) =1a(21) =1a(22) =7828352
External references
- oeis: A374819