876525

Appears in sequences

• a(n) = floor( binomial(n,8)/9).at n=31A011845
• 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=43A022619
• Number of necklaces with 9 black beads and n-9 white beads.at n=23A032194
• Schoenheim bound L_1(n,9,8).at n=22A036836
• a(n) = ceiling(binomial(n,9)/n).at n=31A053733
• Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values (atoms) under action of complementing group.at n=45A054724
• Number of aperiodic necklaces (Lyndon words) with 9 black beads and n white beads.at n=23A263318
• 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=20A281123
• 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=27A281123
• 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=45A340312
• 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=59A340312
• Number of subsets of 9 integers between 1 and n such that their sum is 3 modulo n.at n=22A381351