T(n,k) is the number of non-equivalent distinguishing coloring partitions of the cycle on n vertices with exactly k parts. Regular triangle read by rows, n >= 1, 1 <= k <= n.
A309784
T(n,k) is the number of non-equivalent distinguishing coloring partitions of the cycle on n vertices with exactly k parts. Regular triangle read by rows, n >= 1, 1 <= k <= n.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =0a(7) =0a(8) =1a(9) =1a(10) =0a(11) =0a(12) =4a(13) =2a(14) =1a(15) =0a(16) =1a(17) =8a(18) =10a(19) =3a(20) =1a(21) =0a(22) =1a(23) =25a(24) =32a(25) =16a(26) =3a(27) =1a(28) =0a(29) =4
External references
- oeis: A309784