Triangular number calculator

Client

Triangular numbers count dots arranged in an equilateral triangle. Enter n to get T(n)=n(n+1)/2—handy for combinatorics homework and sequence puzzles.

About Triangular number calculator

Compute the nth triangular number (1, 3, 6, 10, …) from a non‑negative integer—local arithmetic only. The interactive transform on this page runs in your browser tab—Toolcore does not need your paste for the core operation described above.

How to use this page

Paste or type in the main workspace, run the primary action from the toolbar, then copy or download the result. Use Load example when the page offers it, or URL prefill (?q= / ?qb=) so agents and tickets open the same input.

10

Nearby workflows on Toolcore

  • Fibonacci sequence generator — Generate the first n Fibonacci numbers (0, 1, 1, 2, …) locally—up to 500 terms. when units or numeric output should be checked on a related calculator.
  • Prime number checker — Test whether a whole number is prime—BigInt trial division in your browser, no upload. when units or numeric output should be checked on a related calculator.
  • Math expression evaluator — Evaluate basic + − × ÷ arithmetic with parentheses in your browser—no variables. when units or numeric output should be checked on a related calculator.
  • GCD & LCM calculator — Greatest common divisor and least common multiple for two non-negative integers—BigInt, local only. when units or numeric output should be checked on a related calculator.

Common use cases

  • Verify hand counts for triangular figurate numbers in discrete math.
  • Cross-check series terms when writing puzzle or game level generators.

Common mistakes to avoid

  • Using negative n

    Only non-negative integers are defined for this index form.

FAQ

Is T(0) valid?

Yes—T(0)=0 by convention here.

Does this use floating point for huge n?

JavaScript numbers lose integer precision beyond 2^53−1.

More tools

Related utilities you can open in another tab—mostly client-side.