2097684

Appears in sequences

• Number of ways to color vertices of an octagon using <= n colors, allowing only rotations.at n=8A054622
• Number of n-bead necklaces with 8 colors.at n=8A054627
• 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=35A054630
• 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=35A054631
• Number of equivalence classes of n-valued Post functions of 1 variable under action of complementing group C(1,n).at n=7A056665
• a(n) = Sum_{k=1..n} n^(floor(n/k) - 1).at n=7A345030