Difference between revisions of "T(n)^2=T(T(n))+T(T(n)-1)"
From specialfunctionswiki
(→References) |
|||
| Line 7: | Line 7: | ||
==References== | ==References== | ||
| − | * {{PaperReference|Triangular numbers|1974|V.E. Hoggatt, Jr|author2=Marjorie Bicknell|prev=N^2=T(n)+T(n-1)|next=findme}} | + | * {{PaperReference|Triangular numbers|1974|V.E. Hoggatt, Jr|author2=Marjorie Bicknell|prev=N^2=T(n)+T(n-1)|next=findme}} $(1.4)$ |
[[Category:Theorem]] | [[Category:Theorem]] | ||
[[Category:Unproven]] | [[Category:Unproven]] | ||
Revision as of 01:27, 30 May 2017
Theorem
The following formula holds for $n=2,3,4,\ldots$: $$T(n)^2=T(T(n))+T(T(n)-1),$$ where $T(n)$ denotes the $n$th triangular number.
Proof
References
- V.E. Hoggatt, Jr and Marjorie Bicknell: Triangular numbers (1974)... (previous)... (next) $(1.4)$
