cp's OEIS Frontend

The sum of the digits of triangular numbers in most cases is a triangular number. Conjecture: For every triangular number T there exist infinitely many triangular numbers with sum of digits = T.

From Jon E. Schoenfield, Jun 29 2010: (Start)

For any positive k < 132, it is true that more than half of the positive triangular numbers from T(1) through T(k) have a triangular digit sum. However, for any k > 132, more than half of the positive triangular numbers from T(1) through T(k) have a nontriangular digit sum. (At k = 132, there are 66 triangular and 66 nontriangular.)

There exist only finitely many triangular numbers whose digit sum is T(0)=0 or T(1)=1: T(0)=0 is, of course, the only one with digit sum 0, and T(1)=1 and T(4)=10 are the only two with digit sum 1. However, for digit sums equal to each of at least the next several triangular numbers, the conjecture can be easily confirmed by observing that, e.g., T(2), T(20), T(200), T(2000), etc., all have digit sum T(2)=3; T(2+1), T(20+1), T(200+1), T(2000+1), etc., all have digit sum T(3)=6; T(20+2), T(200+2), T(2000+2), T(20000+2), etc., all have digit sum T(4)=10; and, similarly, for all sufficiently large values of j, triangular numbers of the form T(2*10^j+m), where m = 3, 9, 23, 34, 132, 368, 1332, 3943, 19388, 88248, 244948, 1788848, 9838483, 19994343, respectively, will have digit sums T(5)=15, T(6)=21, ..., T(18)=171, respectively. (End)

The sequence is unbounded, as the (10^k + 9)-th triangular number for k>1 is a term.

The sum of the digits of triangular numbers in most cases is a triangular number.

Conjecture: For every triangular number T there exist infinitely many triangular numbers with sum of digits = T.