Calculate the nth triangular number, check if a number is triangular, explore the sequence with dot patterns, and learn properties and identities.
A **triangular number** counts the objects that can form an equilateral triangle. The first few triangular numbers are 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, … and the formula for the nth triangular number is **T(n) = n(n+1)/2**. This elegant expression, famously derived by the young Carl Friedrich Gauss, gives the sum of the first n natural numbers and appears throughout mathematics, computer science, and combinatorics.
Triangular numbers are the simplest class of **figurate numbers** — numbers that can be represented as regular geometric patterns of dots. They connect to binomial coefficients (T(n) = C(n+1, 2)), tetrahedral numbers (the sum of consecutive triangular numbers), and even square numbers (the sum of two consecutive triangular numbers always equals a perfect square). Pascal's third diagonal is exactly the sequence of triangular numbers.
Our **Triangular Numbers Calculator** offers three powerful modes: **Find the nth triangular number** with a beautiful dot-pattern visualization, **Check if a given number is triangular** using the 8t+1 perfect-square test, and **Explore the sequence** up to any limit with growth charts and factor breakdowns. Whether you're studying number theory, exploring sequences for OEIS, or teaching figurate numbers to students, this tool makes the concept visual and interactive.
Triangular numbers are a gateway to number theory and combinatorics. This calculator provides instant computation with beautiful dot-pattern visualizations, the perfect-square test for checking membership, and comprehensive sequence exploration. It's ideal for math students learning about figurate numbers, teachers preparing lessons, or competitive programmers recognizing triangular-number patterns in problems. This tool is designed for quick, accurate results without manual computation. Whether you are a student working through coursework, a professional verifying a result, or an educator preparing examples, accurate answers are always just a few keystrokes away.
T(n) = n(n+1)/2. Test: t is triangular ⟺ 8t+1 is a perfect square. Inverse: n = (−1 + √(1+8t))/2. Sum: Σ T(k) for k=1..n = n(n+1)(n+2)/6 (tetrahedral). Relation: T(n) + T(n−1) = n².
Result: T(10) = 55
The 10th triangular number is 10×11/2 = 55. This equals the sum 1+2+3+…+10, which young Gauss famously computed by pairing numbers: (1+10) + (2+9) + (3+8) + (4+7) + (5+6) = 5 pairs of 11 = 55.
The story of young Carl Friedrich Gauss and the sum 1+2+3+…+100 is one of the most famous anecdotes in mathematics. The pairing trick — matching the first number with the last, the second with the second-to-last, and so on — yields n/2 pairs each summing to n+1, giving the formula T(n) = n(n+1)/2. This insight is the foundation of arithmetic series and appears in the very first proofs students encounter in mathematical induction.
Triangular numbers are identical to binomial coefficients "n+1 choose 2" = C(n+1, 2). This means T(n) counts the number of ways to choose 2 items from n+1 objects — explaining the handshake problem (n people make T(n−1) = C(n,2) handshakes). They form the third diagonal of Pascal's triangle, connecting figurate numbers directly to the binomial theorem.
Triangular numbers are just the beginning of the **figurate number** family. **Square numbers** form squares (n²), **pentagonal numbers** form pentagons (n(3n−1)/2), **hexagonal numbers** form hexagons (n(2n−1)), and the pattern continues for any polygon. In three dimensions, triangular numbers generalize to **tetrahedral numbers** Te(n) = n(n+1)(n+2)/6, then to **pentatope numbers** in four dimensions, and so on. The study of figurate numbers spans over 2,500 years, from Pythagorean mathematics to modern number theory and the theory of modular forms.
A triangular number counts dots that can be arranged in an equilateral triangle pattern. The nth triangular number T(n) = 1+2+3+…+n = n(n+1)/2. The first few are: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55.
A number t is triangular if and only if 8t+1 is a perfect square. Equivalently, compute n = (−1+√(1+8t))/2; if n is a non-negative integer, then t = T(n) is triangular.
According to legend, when the young Carl Friedrich Gauss was asked to sum the numbers 1 to 100, he immediately answered 5050 by recognizing that the sum equals 100×101/2. This is simply T(100) = 5050. Whether the story is exactly true is debated, but the formula T(n)=n(n+1)/2 is often called Gauss's formula.
The sum of two consecutive triangular numbers always equals a perfect square: T(n) + T(n−1) = n². Also, every perfect square can be decomposed this way. Additionally, 8T(n)+1 = (2n+1)² is always an odd perfect square.
Tetrahedral numbers are the 3D analog of triangular numbers — they count dots in a triangular pyramid. The nth tetrahedral number equals the sum of the first n triangular numbers: Te(n) = T(1)+T(2)+…+T(n) = n(n+1)(n+2)/6.
Handshakes at a party (n people make T(n−1) handshakes), bowling pin arrangements (T(4)=10), pool/billiard ball racks (T(5)=15), Pascal's triangle diagonal, round-robin tournament scheduling, and indexing upper/lower triangular matrices in computer science. Understanding this concept helps you apply the calculator correctly and interpret the results with confidence.