299600

Appears in sequences

• Number of ways to color vertices of a heptagon using <= n colors, allowing only rotations.at n=8A054621
• Number of n-bead necklaces with 8 colors.at n=7A054627
• 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=34A054630
• Number of subsets of {1,2,3,...,n} that sum to 0 mod 7.at n=21A068013
• Number of n-bead necklaces with n+1 colors for n>0, with a(0)=1.at n=7A121773
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..7 arrays.at n=21A184294
• Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..7 arrays.at n=27A184294
• For n >= 3, draw a regular n-sided polygon and its n(n-3)/2 diagonals, so there are n(n-1)/2 lines; a(n) is the number of ways to choose a subset of these lines (subsets differing by a rotation are regarded as identical). a(1)=1, a(2)=2 by convention.at n=6A192332
• Number of (n+1)X(6+1) 0..2 arrays with the upper median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=14A237635
• Table read by downward antidiagonals: T(n,k) is the number of tilings of the n X k cylinder by two distinct tiles.at n=42A368264