48915

Appears in sequences

• Number of n-bead necklaces with 5 colors.at n=8A001869
• Number of ways to color vertices of an octagon using <= n colors, allowing only rotations.at n=5A054622
• Triangle read by rows: row n (n >= 1) contains the numbers T(n,k) = Sum_{d|n} phi(d)*k^(n/d)/n, for k=1..n.at n=32A054631
• Necklaces with n beads of 6 colors, no 2 adjacent beads the same color.at n=7A106368
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..4 arrays.at n=28A184288
• a(n) = Sum_{k=0..4} binomial(8,k)*binomial(n,k).at n=12A247609
• Number of nonisomorphic proper colorings of partition multicycle graph using six colors.at n=66A298266
• Inverse Weigh transform of 5^n.at n=7A306159