1043460

Appears in sequences

• Fermat coefficients.at n=14A000973
• Number of nonequivalent dissections of a polygon into n pentagons by nonintersecting diagonals rooted at a cell up to rotation.at n=8A005037
• a(n) = floor(binomial(n,7)/8).at n=36A011844
• Irreducible Euler sums of weight 8 and depth 10+2n.at n=28A031164
• Number of necklaces with 8 black beads and n-8 white beads.at n=29A032193
• Schoenheim bound L_1(n,8,7).at n=28A036835
• a(n) = ceiling(binomial(n,8)/n).at n=36A053731
• A sequence related to numeric partitions and Fermat Coefficients.at n=29A059251
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiples of the sum of their digits (and n raised to k+1 must not be such a multiple). Case k=14.at n=24A135199
• Number of n element multisets of length 3 vectors over GF(2) that sum to zero.at n=29A362906
• Number of subsets of 8 integers between 1 and n such that their sum is 0 modulo n.at n=28A381291
• Number of subsets of 8 integers between 1 and n such that their sum is 2 modulo n.at n=28A381350