A322134 Regular tetrangle where T(n,k,i) is the number of unlabeled connected multiset partitions of weight n with k vertices and i edges.
1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 2, 1, 1, 2, 4, 2, 1, 2, 1, 0, 0, 0, 0, 0, 0, 1, 2, 2, 1, 1, 2, 7, 6, 2, 2, 6, 4, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 1, 3, 3, 2, 1, 1, 3, 14, 17, 9, 3, 3, 17, 18, 7, 2, 9, 7, 1, 3, 1, 0, 0
Offset: 0
Examples
Tetrangle begins: 1 . 0 0 1 . 0 0 0 1 1 1 . 0 0 0 0 1 1 1 1 1 1 . 0 0 0 0 0 1 2 1 1 2 4 2 1 2 1 . 0 0 0 0 0 0 1 2 2 1 1 2 7 6 2 2 6 4 1 2 1 . 0 0 0 0 0 0 0 1 3 3 2 1 1 3 14 17 9 3 3 17 18 7 2 9 7 1 3 1 . 0 0 0 0 0 0 0 0 1 3 4 3 2 1 1 3 20 33 24 11 3 4 33 59 35 10 3 24 35 14 2 11 10 1 3 1