The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 3
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..46. EXAMPLE For n = 2: 16 = 1 + 15 = 6 + 10. For n = 3: 37 = 1 + 15 + 21 = 3 + 6 + 28 = 6 + 10 + 21. CROSSREFS Cf. A000217, A265134, A307597, A307598, A341021-A341027, A342326, A350241. Sequence in context: A068833 A116190 A070587 * A354473 A275186 A224745 Adjacent sequences: A350285 A350286 A350287 * A350289 A350290 A350291 KEYWORD nonn AUTHOR Ilya Gutkovskiy, Dec 23 2021 EXTENSIONS More terms from Jinyuan Wang, Dec 26 2021 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 17:53 EST 2023. Contains 367419 sequences. (Running on oeis4.)