105183

Appears in sequences

• Fermat coefficients.at n=12A000972
• a(n) = floor(C(n,6)/7).at n=31A011797
• 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=41A022619
• Number of necklaces with 7 black beads and n-7 white beads.at n=25A032192
• T(n,7), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 7 black beads and n-7 white beads.at n=25A051172
• Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values (atoms) under action of complementing group.at n=43A054724
• Column 3 of array in A133713.at n=11A133718
• Column 4 of triangle in A133721.at n=48A133723
• 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=19A281123
• 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=28A281123
• Expansion of e.g.f. 2*sec(exp(x)-1) - 2*tan(exp(x)-1) - exp(x).at n=8A335788
• 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=43A340312
• 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=61A340312