A341883 Number of partitions of 2*n+1 into three parts from A339506.
0, 1, 1, 2, 3, 3, 3, 4, 3, 4, 4, 4, 3, 4, 2, 3, 3, 3, 5, 5, 5, 5, 6, 6, 9, 9, 8, 8, 7, 5, 8, 5, 8, 7, 7, 6, 7, 6, 8, 8, 7, 9, 7, 7, 8, 7, 6, 8, 6, 6, 6, 5, 6, 9, 8, 12, 10, 9, 9, 8, 8, 8, 9, 7, 7, 5, 6, 6, 8, 9, 10, 8
Offset: 0
Keywords
Examples
a(0) = 0 because 2*0+1 = 1 is not the sum of 3 terms of A339506. a(1) = 1 because 2*1+1 = 3 and 3 = 1+1+1 (1 is the term of A339506). a(2) = 1 because 2*2+1 = 5 and 5 = 1+1+3 (1 and 3 are terms of A339506). a(3) = 2 because 2*3+1 = 7 and 7 = 1+1+5 = 1+3+3 (1, 3, 5 are terms of A339506). a(4) = 3 because 2*4+1 = 9 and 9 = 1+1+7 = 1+3+5 = 3+3+3 (1, 3, 5, 7 are terms of A339506).
Comments