n for n >= 1. Hence, b_k(n) is the number of symmetric cyclic compositions of n with k parts, where a part of size m can be colored with one of c(m) colors. If C(x) = Sum

User: n for n >= 1. Hence, b_k(n) is the number of symmetric cyclic compositions of n with k parts, where a part of size m can be colored with one of c(m) colors. If C(x) = Sum

n for n >= 1. Hence, b_k(n) is the number of symmetric cyclic compositions of n with k parts, where a part of size m can be colored with one of c(m) colors. If C(x) = Sum's wiki page.

n for n >= 1. Hence, b_k(n) is the number of symmetric cyclic compositions of n with k parts, where a part of size m can be colored with one of c(m) colors. If C(x) = Sum has authored 0 sequences.

cp's OEIS Frontend

User: n for n >= 1. Hence, b_k(n) is the number of symmetric cyclic compositions of n with k parts, where a part of size m can be colored with one of c(m) colors. If C(x) = Sum