25395

Appears in sequences

• Number of bracelets (turnover necklaces) with n beads of 5 colors.at n=7A032276
• Number of ways to color the vertices of an octagon using <= n colors, allowing rotations and reflections.at n=5A060560
• Triangle T(n,k) read by rows, giving number of bracelets (turnover necklaces) with n beads of k colors (n >= 1, 1 <= k <= n).at n=32A081720
• Number of n-bead necklaces of 6 colors allowing reversal, with no adjacent beads having the same color.at n=7A208542
• n * Lucas(n) - (n - 1) * Lucas(n - 1).at n=16A246715
• a(n) = a(n-1) + 16*a(n-3) - 16*a(n-4), where a(0) = 1, a(1) = 4, a(2) = 7, a(3) = 19.at n=10A297556
• Write n-th prime in binary, then increase each run of 0's by one 0, and increase each run of 1's by one 1. a(n) is the decimal equivalent of the result.at n=34A319406
• Records in A175046.at n=16A319422
• Triangle read by rows: T(n,k) = number of collections of up to k subsets of [n] covering [n], with [0]={}; n>=0, k=0..2^n.at n=26A381683