MathDB

Triangular numbers are numbers of the form

1 + 2 + . . . + n

with positive integer

n

, that is

1, 3, 6, 10

, . . . . Find the largest non-triangular positive integer number that cannot be represented as the sum of distinct triangular numbers. Proposed by A. Golovanov

Problem Statement