10855425

Appears in sequences

• Triangle T(n,k)of numbers of asymmetric Boolean functions of n variables with exactly k = 0..2^n nonzero values (atoms) under action of complementing group C(n,2).at n=47A022619
• T(2n+6,n), array T as in A051168; a count of Lyndon words.at n=13A050184
• Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values (atoms) under action of complementing group.at n=49A054724
• Values of A196189 such that both k and A196189(k) are odd.at n=17A217092
• Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = 2^(-n)*((x+1)^(2^n) - (x-1)^(2^n))/2.at n=22A281123
• Triangle T read by rows: n-th row (n>=0) gives the non-vanishing coefficients of the polynomial q(n,x) = 2^(-n)*((x+1)^(2^n) - (x-1)^(2^n))/2.at n=25A281123
• A(n,k) = binomial((2*k+1)*n+2, k*n+1)/((2*k+1)*n+2), square array A(n,k) read by antidiagonals, for n >= 0, k >= 0.at n=42A306444
• Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.at n=49A340312
• Triangle read by rows: T(n,k) is the number of subsets of {0..2^n-1} with k elements such that the bitwise-xor of all the subset members gives zero, 0 <= k <= 2^n.at n=55A340312