81686

Appears in sequences

• Number of aperiodic necklaces of n beads of 2 colors, 10 of them black.at n=13A032168
• a(n) = T(2*n+4, n), array T as in A051168 (a count of Lyndon words).at n=10A050182
• Number of 5-length words w over n-ary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=11A213284
• Composite squarefree numbers n such that p(i)-10 divides n+10, where p(i) are the prime factors of n.at n=35A225710