A350288 a(n) is the smallest number which can be represented as the sum of n distinct nonzero triangular numbers in exactly n ways, or 0 if no such number exists.
1, 16, 37, 64, 83, 128, 177, 204, 270, 352, 430, 533, 632, 764, 893, 1102, 1256, 1443, 1630, 1855, 2141, 2384, 2699, 3053, 3378, 3753, 4176, 4620, 5068, 5570, 6107, 6654, 7253, 7904, 8526, 9241, 9975, 10699, 11533, 12401, 13301, 14189, 15179, 16233, 17286, 18412
Offset: 1
Keywords
Examples
For n = 2: 16 = 1 + 15 = 6 + 10. For n = 3: 37 = 1 + 15 + 21 = 3 + 6 + 28 = 6 + 10 + 21.
Extensions
More terms from Jinyuan Wang, Dec 26 2021