33067440

Appears in sequences

• Number of necklaces with n labeled beads of 3 colors.at n=7A032179
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*9^j.at n=31A038263
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*6^j.at n=32A038296
• Triangular array read by rows. T(n,k) is the number of rooted labeled trees on n nodes such that the root node has degree k. n>=2, 1<=k<=n-1.at n=39A206429
• Triangle read by rows where T(n,k) is the number of labeled simple connected graphs with n vertices and exactly k bridges.at n=50A327072