312455

Appears in sequences

• a(n) = floor( binomial(n,9)/10 ).at n=26A011846
• Number of aperiodic necklaces of n beads of 2 colors, 10 of them black.at n=16A032168
• Number of necklaces with 10 black beads and n-10 white beads.at n=17A032195
• T(2n+7,n), array T as in A051168; a count of Lyndon words.at n=10A050185
• Quotient: squarefree kernel of A002944(n) divided by that of A001405.at n=51A056611
• Quotient: squarefree kernel of A002944(n) divided by that of A001405.at n=52A056611
• Number of admissible sequences of order j; related to 3x+1 problem and Wagon's constant.at n=16A100982
• Product of primes which do not exceed n and do not divide the swinging factorial n$ (A056040).at n=52A163644
• Length of Collatz dropping time patterns in A186008.at n=17A186009
• Numerator of the frequency of the n-th dropping time in the Collatz iteration.at n=17A186107
• a(n) = lcm(n, n+1, n+2, n+3, n+4, n+5, n+6, n+7)/840.at n=19A188897
• a(n) is the number of odd numbers k < 2^n such that A260590(k) = n.at n=26A260591
• a(n) is the denominator of the sum of reciprocals of primes not exceeding n and not dividing binomial(2*n, n).at n=25A334075