$T_n = \sum_{i=1}^n i = n(n + 1) / 2$
This page is auto-translated from /nishio/三角数 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.