A194436 Triangle read by rows: T(n,k) = number of parts in the k-th region of n.
1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 5, 1, 2, 3, 1, 5, 1, 7, 1, 2, 3, 1, 5, 1, 7, 1, 2, 1, 11, 1, 2, 3, 1, 5, 1, 7, 1, 2, 1, 11, 1, 2, 1, 15, 1, 2, 3, 1, 5, 1, 7, 1, 2, 1, 11, 1, 2, 1, 15, 1, 2, 1, 4, 1, 1, 22, 1, 2, 3, 1, 5, 1, 7, 1, 2, 1, 11, 1, 2, 1, 15
Offset: 1
Examples
Triangle begins: 1; 1,2; 1,2,3; 1,2,3,1,5; 1,2,3,1,5,1,7; 1,2,3,1,5,1,7,1,2,1,11; 1,2,3,1,5,1,7,1,2,1,11,1,2,1,15; 1,2,3,1,5,1,7,1,2,1,11,1,2,1,15,1,2,1,4,1,1,22; ... Row n has length A000041(n). Row sums give A006128, n >= 1. Right border gives A000041, n >= 1. Records in every row give A000041, n >= 1. Rows converge to A194446.