The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with exactly k parts (k>=1). Regular triangle read by rows: the rows are indexed by n, the number of vertices of the path, and the columns are indexed by k, the number of parts.
A309748
The number of non-equivalent distinguishing coloring partitions of the path on n vertices (n>=1) with exactly k parts (k>=1). Regular triangle read by rows: the rows are indexed by n, the number of vertices of the path, and the columns are indexed by k, the number of parts.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =4a(8) =4a(9) =1a(10) =0a(11) =6a(12) =14a(13) =6a(14) =1a(15) =0a(16) =16a(17) =49a(18) =37a(19) =9a(20) =1a(21) =0a(22) =28a(23) =154a(24) =182a(25) =76a(26) =12a(27) =1a(28) =0a(29) =64
External references
- oeis: A309748