Square triangular number

In mathematics, a square triangular number (or triangular square number) is a number which is both a triangular number and a square number, in other words, the sum of all integers from ${\displaystyle 1}${\displaystyle 1} to ${\displaystyle n}${\displaystyle n} has a square root that is an integer. There are infinitely many square triangular numbers; the first few are:

Write ${\displaystyle N_{k}}${\displaystyle N_{k}} for the ${\displaystyle k}${\displaystyle k}th square triangular number, and write ${\displaystyle s_{k}}${\displaystyle s_{k}} and ${\displaystyle t_{k}}${\displaystyle t_{k}} for the sides of the corresponding square and triangle, so that

Define the triangular root of a triangular number ${\displaystyle N={\tfrac {n(n+1)}{2}}}${\displaystyle N={\tfrac {n(n+1)}{2}}} to be ${\displaystyle n}${\displaystyle n}. From this definition and the quadratic formula,

Therefore, ${\displaystyle N}${\displaystyle N} is triangular (${\displaystyle n}${\displaystyle n} is an integer) if and only if ${\displaystyle 8N+1}${\displaystyle 8N+1} is square. Consequently, a square number ${\displaystyle M^{2}}${\displaystyle M^{2}} is also triangular if and only if ${\displaystyle 8M^{2}+1}${\displaystyle 8M^{2}+1} is square, that is, there are numbers ${\displaystyle x}${\displaystyle x} and ${\displaystyle y}${\displaystyle y} such that ${\displaystyle x^{2}-8y^{2}=1}${\displaystyle x^{2}-8y^{2}=1}. This is an instance of the Pell equation ${\displaystyle x^{2}-ny^{2}=1}${\displaystyle x^{2}-ny^{2}=1} with ${\displaystyle n=8}${\displaystyle n=8}. All Pell equations have the trivial solution ${\displaystyle x=1,y=0}${\displaystyle x=1,y=0} for any ${\displaystyle n}${\displaystyle n}; this is called the zeroth solution, and indexed as ${\displaystyle (x_{0},y_{0})=(1,0)}${\displaystyle (x_{0},y_{0})=(1,0)}. If ${\displaystyle (x_{k},y_{k})}${\displaystyle (x_{k},y_{k})} denotes the ${\displaystyle k}${\displaystyle k}th nontrivial solution to any Pell equation for a particular ${\displaystyle n}${\displaystyle n}, it can be shown by the method of descent that the next solution is

Hence there are infinitely many solutions to any Pell equation for which there is one non-trivial one, which is true whenever ${\displaystyle n}${\displaystyle n} is not a square. The first non-trivial solution when ${\displaystyle n=8}${\displaystyle n=8} is easy to find: it is ${\displaystyle (3,1)}${\displaystyle (3,1)}. A solution ${\displaystyle (x_{k},y_{k})}${\displaystyle (x_{k},y_{k})} to the Pell equation for ${\displaystyle n=8}${\displaystyle n=8} yields a square triangular number and its square and triangular roots as follows:

Hence, the first square triangular number, derived from ${\displaystyle (3,1)}${\displaystyle (3,1)}, is ${\displaystyle 1}${\displaystyle 1}, and the next, derived from ${\displaystyle 6\cdot (3,1)-(1,0)=(17,6)}${\displaystyle 6\cdot (3,1)-(1,0)=(17,6)}, is ${\displaystyle 36}${\displaystyle 36}.

The sequences ${\displaystyle N_{k}}${\displaystyle N_{k}}, ${\displaystyle s_{k}}${\displaystyle s_{k}} and ${\displaystyle t_{k}}${\displaystyle t_{k}} are the OEIS sequences OEIS: A001110 , OEIS: A001109 , and OEIS: A001108 respectively.

In 1778 Leonhard Euler determined the explicit formula^{[1] [2] : 12–13}

Other equivalent formulas (obtained by expanding this formula) that may be convenient include

The corresponding explicit formulas for ${\displaystyle s_{k}}${\displaystyle s_{k}} and ${\displaystyle t_{k}}${\displaystyle t_{k}} are:^{[2] : 13}

The solution to the Pell equation can be expressed as a recurrence relation for the equation's solutions. This can be translated into recurrence equations that directly express the square triangular numbers, as well as the sides of the square and triangle involved. We have^{[3] : (12)}

We have^{[1] [2] : 13}

All square triangular numbers have the form ${\displaystyle b^{2}c^{2}}${\displaystyle b^{2}c^{2}}, where ${\displaystyle {\tfrac {b}{c}}}${\displaystyle {\tfrac {b}{c}}} is a convergent to the continued fraction expansion of ${\displaystyle {\sqrt {2}}}${\displaystyle {\sqrt {2}}}, the square root of 2.^[4]

A. V. Sylwester gave a short proof that there are infinitely many square triangular numbers: If the ${\displaystyle n}${\displaystyle n}th triangular number ${\displaystyle {\tfrac {n(n+1)}{2}}}${\displaystyle {\tfrac {n(n+1)}{2}}} is square, then so is the larger ${\displaystyle 4n(n+1)}${\displaystyle 4n(n+1)}th triangular number, since:

The left hand side of this equation is in the form of a triangular number, and as the product of three squares, the right hand side is square.^[5]

The generating function for the square triangular numbers is:^[6]

${\displaystyle {\frac {1+z}{(1-z)\left(z^{2}-34z+1\right)}}=1+36z+1225z^{2}+\cdots }${\displaystyle {\frac {1+z}{(1-z)\left(z^{2}-34z+1\right)}}=1+36z+1225z^{2}+\cdots }

• Cannonball problem, on numbers that are simultaneously square and square pyramidal
• Sixth power, numbers that are simultaneously square and cubical

• Triangular numbers that are also square at cut-the-knot
• Weisstein, Eric W. "Square Triangular Number". MathWorld .
• Michael Dummett's solution

• Figurate numbers
• Integer sequences

• CS1 Latin-language sources (la)
• Articles with short description
• Short description matches Wikidata