cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A350042 Sum of all the parts in the partitions of n into 3 positive integer parts.

Original entry on oeis.org

0, 0, 0, 3, 4, 10, 18, 28, 40, 63, 80, 110, 144, 182, 224, 285, 336, 408, 486, 570, 660, 777, 880, 1012, 1152, 1300, 1456, 1647, 1820, 2030, 2250, 2480, 2720, 3003, 3264, 3570, 3888, 4218, 4560, 4953, 5320, 5740, 6174, 6622, 7084, 7605, 8096, 8648, 9216, 9800, 10400
Offset: 0

Views

Author

Wesley Ivan Hurt, Dec 10 2021

Keywords

Examples

			a(9) = 63 since we have the partitions (1,1,7), (1,2,6), (1,3,5), (1,4,4), (2,2,5), (2,3,4) and (3,3,3). Since the parts in each partition sum to 9 and we have 7 partitions, a(9) = 9*7 = 63.
		

Crossrefs

Cf. A069905.

Programs

Formula

a(n) = n * A069905(n).