Square triangular number
From Wikipedia, the free encyclopedia
A square triangular number (or triangular square number) is a number which is both a triangular number and a perfect square. There are an infinite number of triangular squares, given by the formula
or by the linear recursion
- Nk = 34Nk − 1 − Nk − 2 + 2 with N0 = 0 and N1 = 1
The first few square triangular numbers are 1, 36, 1225, 41616, 1413721, 48024900, 1631432881, 55420693056, 1882672131025, ... (sequence A001110 in OEIS)
The problem of finding square triangular numbers reduces to Pell's equation in the following way. Every triangular number is of the form n(n + 1)/2. Therefore we seek integers n, m such that
- n(n + 1) / 2 = m2.
With a bit of algebra this becomes
- (2n + 1)2 = 8m2 + 1,
and then letting k = 2n + 1 and h = 2m, we get the Diophantine equation
- k2 = 2h2 + 1
which is an instance of Pell's equation and is solved by the Pell numbers.
We get the recursion
- mk = 6mk − 1 − mk − 2.
Also, note that
since m0 = 1 and m1 = 6.
The kth triangular square Nk is equal to the sth perfect square and the tth triangular number, such that
t is given by the formula
or by the recursion
As k becomes larger, the ratio t/s approaches the square root of two: Also ratio of successive square triangulars converges to 17+12(sqrt(2))
[edit] References
- Sesskin, Sam (1962). "A "converse" to Fermat's last theorem?". Mathematics Magazine 35 (4): 215–217.