5381685

Appears in sequences

• Number of ways to color vertices of an octagon using <= n colors, allowing only rotations.at n=9A054622
• Number of n-bead necklaces with 9 colors.at n=8A054628
• T(n,k) = Sum_{d|k} phi(d)*n^(k/d)/k, triangle read by rows, T(n,k) for n >= 1 and 1 <= k <= n.at n=43A054630
• Number of n-bead necklaces with n+1 colors for n>0, with a(0)=1.at n=8A121773