A225597 Triangle read by rows: T(n,k) = total number of parts of all regions of the set of partitions of n whose largest part is k.
1, 1, 2, 1, 2, 3, 1, 3, 3, 5, 1, 3, 4, 5, 7, 1, 4, 5, 7, 7, 11, 1, 4, 6, 8, 9, 11, 15, 1, 5, 7, 11, 10, 15, 15, 22, 1, 5, 9, 12, 13, 17, 19, 22, 30, 1, 6, 10, 16, 15, 22, 21, 29, 30, 42, 1, 6, 12, 18, 19, 25, 26, 32, 38, 42, 56, 1, 7, 14, 23, 22, 33, 29, 41, 42, 54, 56, 77
Offset: 1
Examples
For n = 5 and k = 3 the set of partitions of 5 contains two regions whose largest part is 3, they are third region which contains three parts [3, 1, 1] and the sixth region which contains only one part [3]. Therefore the total number of parts is 3 + 1 = 4, so T(5,3) = 4. . . Diagram Illustration of parts ending in column k: . for n=5 k=1 k=2 k=3 k=4 k=5 . _ _ _ _ _ _ _ _ _ _ . |_ _ _ | _ _ _ |_ _ _ _ _| . |_ _ _|_ | |_ _ _| _ _ _ _ |_ _| . |_ _ | | _ _ |_ _ _ _| |_| . |_ _|_ | | |_ _| _ _ _ |_ _| |_| . |_ _ | | | _ _ |_ _ _| |_| |_| . |_ | | | | _ |_ _| |_| |_| |_| . |_|_|_|_|_| |_| |_| |_| |_| |_| . k = 1 2 3 4 5 . The 5th row lists: 1 3 4 5 7 . Triangle begins: 1; 1, 2; 1, 2, 3; 1, 3, 3, 5; 1, 3, 4, 5, 7; 1, 4, 5, 7, 7, 11; 1, 4, 6, 8, 9, 11, 15; 1, 5, 7, 11, 10, 15, 15, 22; 1, 5, 9, 12, 13, 17, 19, 22, 30; 1, 6, 10, 16, 15, 22, 21, 29, 30, 42; 1, 6, 12, 18, 19, 25, 26, 32, 38, 42, 56; 1, 7, 14, 23, 22, 33, 29, 41, 42, 54, 56, 77;
Comments