yaworsw/euler-manager

---
:id: 378
:name: Triangle Triples
:url: https://projecteuler.net/problem=378
:content: "| Let T(<var>n</var>) be the <var>n</var><sup>th</sup> triangle number,
  so T(<var>n</var>) = | \n\n| <var>n</var> (<var>n</var>+1) |\n| 2 |\n\n | . |\n\nLet
  dT(<var>n</var>) be the number of divisors of T(<var>n</var>).  \nE.g.: T(7) = 28
  and dT(7) = 6.\n\nLet Tr(<var>n</var>) be the number of triples (<var>i</var>, <var>j</var>,
  <var>k</var>) such that 1 ≤ <var>i &lt; j &lt; k ≤ n</var> and dT(<var>i</var>)
  \\> dT(<var>j</var>) \\> dT(<var>k</var>).  \nTr(20) = 14, Tr(100) = 5772 and Tr(1000)
  = 11174776.\n\nFind Tr(60 000 000).   \nGive the last 18 digits of your answer.\n\n"