Let $T_n = \frac{1}{6}n(n+1)(n+2)$ denote the $n$th Tetrahedral number. The first several solutions to squares as sums of two Tetrahedral numbers are {T_n,T_m,a^2} 1 5 6\ 1 8 11\ 1 22 45\ 1 24 51\ 1 63 209\ 2 9 13\ 2 23 48\ 2 94 378\ 2 96 390\ 8 12 22\ 8 17 33\ 8 38 100\ 8 111 484\ 9 12 23\ 9 21 44\ 9 28 65\ 10 15 30\ 10 169 905\ 13 83 315\ 15 22 52\ 15 33 85\ 15 42 118\ 15 87 338\ 16 30 76\ 16 82 310\ 17 30 77\ 22 24 68\ 22 28 78\ 23 24 70\ 23 41 121\ 23 132 628\ 30 34 110\ 31 78 296\ 33 86 341\ 38 81 319\ 41 68 259\ 41 85 344\ 42 50 188\ 48 71 286\ 54 65 275\ 56 134 664\ 58 167 908\ 62 128 632\ 64 81 371\ 65 79 365\ 65 152 803\ 68 78 370\ 78 96 484\ 78 112 568\ 79 138 730\ 79 161 891\ 82 159 882\ 96 145 819\ 129 144 935\ Prove that there are infinitely many solutions.