210126

Appears in sequences

• Number of ways to color vertices of an octagon using <= n colors, allowing only rotations.at n=6A054622
• Number of n-bead necklaces with 6 colors.at n=8A054625
• 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=33A054631
• Numbers m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,55.at n=21A065696
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..5 arrays.at n=28A184291
• Number of n-bead necklaces of 7 colors not allowing reversal, with no adjacent beads having the same color.at n=7A208534